DOIAbstract
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynomial time equivalent to deciding isomorphism of graphs. The implications of this to the analysis of two-graphs are discussed
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynomial time equivalent to deciding isomorphism of graphs. The implications of this to the analysis of two-graphs are discussed
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynom...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic o...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynom...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those verti...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic o...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
Switching graphs are graphs containing switches. By using boolean functions called switch settings, ...
AbstractAn open question is the computational complexity of recognizing when two graphs are isomorph...
Add to ORKG