Sciweavers

5473 search results - page 27 / 1095
» On the graph isomorphism problem
Sort
View
114
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 2 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
14 years 11 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
85
Voted
ICPR
2000
IEEE
16 years 25 days ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
176
Voted
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
16 years 1 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 2 days ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous