4865 search results - page 164 / 973 » The Complexity of Graph Connectivity |
126
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
99
Voted
JDA
2006
15 years 3 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
124
click to vote
MST
2006
15 years 3 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
105
Voted
GC
2002
Springer
15 years 3 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
131
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...