An Algorithmic Study of Switch Graphs

Authors:
Bastian Katz;Ignaz Rutter;Gerhard Woeginger
Affiliations:
Faculty of Informatics, Universität Karlsruhe (TH), KIT,;Faculty of Informatics, Universität Karlsruhe (TH), KIT,;Department of Mathematics and Computer Science, TU Eindhoven,
Venue:
Graph-Theoretic Concepts in Computer Science
Year:
2009

Citing 0
Cited 1

Optimal binary space partitions in the plane

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.