Switching Graphs

Authors:
Jan Friso Groote;Bas Ploeger
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 6
Cited 0

Linear logic

Theoretical Computer Science
Switching Graphs and Their Complexity

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Matching: a well-solved class of integer linear programs

Combinatorial optimization - Eureka, you shrink!
Edge-disjoint routing in plane switch graphs in linear time

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems, switching graphs are a remarkable straightforward and natural model, but they have hardly been studied. We study the complexity of several natural questions in switching graphs of which some are polynomial, and others are NP-complete. We started investigating switching graphs because they turned out to be a natural framework for studying the problem of solving Boolean equation systems, which is equivalent to model checking of the modal @m-calculus and deciding the winner in parity games. We give direct, polynomial encodings of Boolean equation systems in switching graphs and vice versa, and prove correctness of the encodings.