Pages that link to "Item:Q3522937"
From MaRDI portal
The following pages link to Treewidth: Characterizations, Applications, and Computations (Q3522937):
Displaying 50 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed elimination games (Q896668) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Tree-length equals branch-length (Q1044006) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- On the tree-depth and tree-width in heterogeneous random graphs (Q2102520) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- Semiring induced valuation algebras: exact and approximate local computation algorithms (Q2389661) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Most frugal explanations in Bayesian networks (Q2512987) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- (Q3386630) (← links)
- Characterization and Recognition of Digraphs of Bounded Kelly-width (Q3508574) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- (Q5136270) (← links)
- The Valve Location Problem in Simple Network Topologies (Q5302043) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
- Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
