Pages that link to "Item:Q5492905"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492905):
Displaying 28 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed elimination games (Q896668) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Characterization and Recognition of Digraphs of Bounded Kelly-width (Q3508574) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- (Q5005146) (← links)
- (Q5090497) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- Undirected Graphs of Entanglement 2 (Q5458861) (← links)
- (Q5743498) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)