Sciweavers

5473 search results - page 43 / 1095
» On the graph isomorphism problem
Sort
View
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
15 years 11 months ago
Graph signature for self-reconfiguration planning of modules with symmetry
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
Masoud Asadpour, Mohammad Hassan Zokaei Ashtiani, ...
ECCC
2011
205views ECommerce» more  ECCC 2011»
14 years 11 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
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 ...
Fabian Wagner
DM
2008
89views more  DM 2008»
15 years 4 months ago
Primitive 2-factorizations of the complete graph
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...
Giuseppe Mazzuoccolo
EJC
2007
15 years 4 months ago
The homology of the cycle matroid of a coned graph
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
Woong Kook
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 8 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas