Sciweavers

5473 search results - page 20 / 1095
» On the graph isomorphism problem
Sort
View
ICAPR
2005
Springer
15 years 5 months ago
The RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
Marco Gori, Marco Maggini, Lorenzo Sarti
JCT
2011
56views more  JCT 2011»
14 years 6 months ago
Twins of rayless graphs
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
Anthony Bonato, Henning Bruhn, Reinhard Diestel, P...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
16 years 1 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
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
15 years 4 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
15 years 3 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky