75 search results - page 5 / 15 » Fast Algorithm for Graph Isomorphism Testing |
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
ECCC
2011
13 years 2 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
PKDD
2004
Springer
14 years 27 days ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...