1097 search results - page 33 / 220 » Testing Graph Isomorphism |
SIAMDM
2008
14 years 9 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
VC
1998
14 years 9 months ago
1998
Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...
ISSAC
1989
Springer
15 years 1 months ago
1989
Springer
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
COMBINATORICS
2006
14 years 9 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...