731 search results - page 30 / 147 » Reductions to Graph Isomorphism |
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
ECCC
2011
13 years 3 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 ...
RTA
2004
Springer
14 years 2 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
DM
2008
13 years 8 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...