1008 search results - page 1 / 202 » Canonicity! |
JCSS
2010
13 years 5 months ago
2010
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploi...
GD
2009
Springer
14 years 1 days ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
22
Voted
MOC
2010
13 years 2 months ago
2010
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
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 ...