@inproceedings{33ebb75a5fa64804aa77f1c36866f1f1,
title = "An algorithmic study of switch graphs",
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.",
author = "B. Katz and I. Rutter and G.J. Woeginger",
year = "2010",
doi = "10.1007/978-3-642-11409-0\_20",
language = "English",
isbn = "978-3-642-11408-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "226--237",
editor = "C. Paul and M. Habib",
booktitle = "Graph-Theoretic Concepts in Computer Science (35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers)",
address = "Germany",
}