4009 search results - page 112 / 802 » Clustering on Complex Graphs |
136
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
240
click to vote
MST
2011
14 years 6 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
129
click to vote
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...
101
click to vote
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
127
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...