882 search results - page 10 / 177 » On the Hardness of Graph Isomorphism |
STACS
1992
Springer
14 years 19 days ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
CP
2007
Springer
14 years 2 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
SWAT
2010
Springer
14 years 1 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
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 ...
PVLDB
2010
13 years 7 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...