251 search results - page 9 / 51 » Graph Isomorphism is in SPP |
96
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
PVLDB
2008
14 years 11 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
173
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
CP
2007
Springer
15 years 5 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...
99
Voted
SWAT
2010
Springer
15 years 4 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...