882 search results - page 13 / 177 » On the Hardness of Graph Isomorphism |
ENDM
2006
13 years 8 months ago
2006
SIAMCOMP
2008
13 years 8 months ago
2008
TGC
2010
Springer
13 years 6 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
JCT
2010
13 years 7 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...