Parity games on temporal graphs
From MaRDI portal
Publication:6629452
DOI10.1007/978-3-031-57228-9_5MaRDI QIDQ6629452
Sougata Bose, Patrick Totzke, Pete Austin
Publication date: 30 October 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Positional strategies for mean payoff games
- A note on the space complexity of some decision problems for finite automata
- A theory of timed automata
- Temporal vertex cover with a sliding time window
- Sliding window temporal graph coloring
- Universal graphs and good for games automata: new tools for infinite duration games
- A note on emptiness for alternating finite automata with a one-letter alphabet
- On temporal graph exploration
- Distributed computation in dynamic networks
- Traveling Salesman Problems in Temporal Graphs
- Complexity of Subcases of Presburger Arithmetic
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Exploration of Periodically Varying Graphs
- Alternation
- On the synthesis of discrete controllers for timed systems
- Deciding parity games in quasipolynomial time
- Temporal Network Theory
- Reachability-Time Games on Timed Automata
- Querying and Embedding Compressed Texts
- Timed Parity Games: Complexity and Robustness
- Cops \& robber on periodic temporal graphs: characterization and improved bounds
- Computing maximum matchings in temporal graphs
This page was built for publication: Parity games on temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629452)
