731 search results - page 11 / 147 » Reductions to Graph Isomorphism |
TASE
2007
IEEE
14 years 2 months ago
2007
IEEE
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (or...
WG
2007
Springer
14 years 2 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
COMBINATORICS
2007
13 years 8 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
STACS
1987
Springer
14 years 2 days ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...