SWITCHING GRAPHS

DOI10.1142/S0129054109006930zbMath1187.68314MaRDI QIDQ3646171

B. Ploeger, Jan Friso Groote

Publication date: 19 November 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

parity gamesmodel checkingswitching graphsBoolean equation systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Unnamed Item ⋮ Reachability Switching Games ⋮ An algorithmic study of switch graphs

Cites Work

• Linear logic
• Results on the propositional \(\mu\)-calculus
• The directed subgraph homeomorphism problem
• Path problems in skew-symmetric graphs
• Edge-disjoint routing in plane switch graphs in linear time
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: SWITCHING GRAPHS