882 search results - page 13 / 177 » On the Hardness of Graph Isomorphism |
69
Voted
ENDM
2006
15 years 1 months ago
2006
63
Voted
SIAMCOMP
2008
15 years 1 months ago
2008
149
Voted
TGC
2010
Springer
14 years 11 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...
141
click to vote
DAM
1999
15 years 1 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...
128
click to vote
JCT
2010
15 years 9 days 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...