Sciweavers

192 search results - page 2 / 39
» On Graph Isomorphism for Restricted Graph Classes
Sort
View
MFCS
2009
Springer
13 years 10 months ago
Representing Groups on Graphs
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
Sagarmoy Dutta, Piyush P. Kurur
DAM
1999
128views more  DAM 1999»
13 years 5 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
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...
Serafino Cicerone, Gabriele Di Stefano
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
13 years 4 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
MFCS
2007
Springer
14 years 8 days ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
13 years 10 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...