504 search results - page 2 / 101 » Canonical Graph Shapes |
GD
2009
Springer
13 years 10 months 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...
ECCC
2011
13 years 23 days 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 ...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
ACCV
2010
Springer
13 years 25 days ago
2010
Springer
We propose a method to measure similarity of shape for 3D objects using 3-dimensional shape subspaces produced by the factorization method. We establish an index of shape similarit...
LMCS
2006
13 years 5 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...