Sciweavers

731 search results - page 10 / 147
» Reductions to Graph Isomorphism
Sort
View
136
Voted
PVLDB
2008
108views more  PVLDB 2008»
15 years 3 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
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...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
218
Voted
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
16 years 5 months ago
Graph Database Indexing Using Structured Graph Decomposition
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...
David W. Williams, Jun Huan, Wei Wang 0010
161
Voted
DM
2006
128views more  DM 2006»
15 years 3 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
140
Voted
STACS
1992
Springer
15 years 7 months ago
Graph Isomorphism is Low for PP
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...
Johannes Köbler, Uwe Schöning, Jacobo To...
140
Voted
CP
2007
Springer
15 years 10 months ago
Filtering for Subgraph Isomorphism
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...
Stéphane Zampelli, Yves Deville, Christine ...