Abstract: In communication networks such as social networks, wireless networks and biology networks, it is of importance to find all cliques which can help understand the network topology. The clique ...
Given an undirected graph, the objective of the Maximum Clique problem is to find a set of mutually adjacent vertices that contains the largest possible number of vertices. Many problems from various ...
Abstract: The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback