Sciweavers

1097 search results - page 19 / 220
» Testing Graph Isomorphism
Sort
View
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 10 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
ICPR
2002
IEEE
15 years 10 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
JCSS
2010
77views more  JCSS 2010»
14 years 8 months ago
Isomorphism and canonization of tournaments and hypertournaments
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
STACS
2010
Springer
15 years 4 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall