The Simple Reachability Problem in Switch Graphs

Authors:
Klaus Reinhardt
Affiliations:
Universität Tübingen, Sand 13, Germany
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 5
Cited 0

General factors of graphs

Journal of Combinatorial Theory Series B
Isolation, matching and counting uniform and nonuniform upper bounds

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Space-bounded reducibility among combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Switch graphs as introduced in [Coo03] are a natural generalization of graphs where edges are interpreted as train tracks connecting switches: Each switch has an obligatory incident edge which has to be used by every path going through this switch. We prove that the simple reachability problem in switch graphs is NP-complete in general, but we describe a polynomial time algorithm for the undirected case. As an application, this can be used to find an augmenting path for bigamist matchings and thus iteratively construct a maximum bigamist matching for a given bipartite graph with red and blue edges, that is the maximum set of vertex disjoint triples consisting of one bigamist vertex connected to two monogamist vertices with two different colors. This this gives an independent direct solution to an open problem in [SGYB05].