Pages that link to "Item:Q1929212"
From MaRDI portal
The following pages link to Entanglement and the complexity of directed graphs (Q1929212):
Displayed 13 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Spectral complexity of directed graphs and application to structural decomposition (Q2424711) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- (Q5015265) (← links)
- (Q5114824) (← links)