We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove hardness of the following problems: Given a switch graph, does it possess a bipartite / planar / triangle-free / Eulerian configuration? On the positive side we design fast algorithms for several connectivity problems in undirected switch graphs, and for recognizing acyclic configurations in directed switch graphs
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, ...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
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...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
AbstractSwitching graphs are graphs containing switches. By using boolean functions called switch se...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
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, ...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
We derive a variety of results on the algorithmics of switch graphs. On the negative side we prove h...
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...
Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the sam...
AbstractSwitching graphs are graphs containing switches. By using boolean functions called switch se...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
Seidel's switching is a graph operation , which for a given graph G and one of its vertices v gives ...
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, ...
DOI
Add to ORKG