Treewidth: Characterizations, Applications, and Computations
From MaRDI portal
Publication:3522937
Recommendations
Cited in
(68)- The parameterized complexity of the induced matching problem
- Tree-length equals branch-length
- Treewidth. Computations and approximations
- Special issue: Treewidth
- A short note on the complexity of computing strong pathbreadth
- The critical node detection problem in networks: a survey
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- On the complexity of computing treebreadth
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Structurally parameterized \(d\)-scattered set
- On the tree-depth and tree-width in heterogeneous random graphs
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Parameterized orientable deletion
- Efficient parallel algorithms for parameterized problems
- Estimating the probability of meeting a deadline in schedules and plans
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- A note on the complexity of matching patterns with variables
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Most frugal explanations in Bayesian networks
- Boxicity and treewidth
- On treewidth approximations
- On the complexity of computing treebreadth
- Finding good decompositions for dynamic programming on dense graphs
- On exact algorithms for treewidth
- Treewidth and the Computational Complexity of MAP Approximations
- Parameters tied to treewidth
- Compact navigation and distance oracles for graphs with small treewidth
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
- A quartic kernel for pathwidth-one vertex deletion
- Are there any good digraph width measures?
- A local search algorithm for branchwidth
- The label cut problem with respect to path length and label frequency
- Extension complexity, MSO logic, and treewidth
- Characterization and Recognition of Digraphs of Bounded Kelly-width
- scientific article; zbMATH DE number 730042 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Revisiting decomposition by clique separators
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Modular-width: an auxiliary parameter for parameterized parallel complexity
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- Compact navigation and distance oracles for graphs with small treewidth
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Experimental Analysis of Treewidth
- Adapting the directed grid theorem into an FPT algorithm
- Threshold Treewidth and Hypertree Width
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Treewidth of display graphs: bounds, brambles and applications
- The Valve Location Problem in Simple Network Topologies
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Treewidth: Structure and Algorithms
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Tree decompositions and social graphs
- LATIN 2004: Theoretical Informatics
- On the (di)graphs with (directed) proper connection number two
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Flexible list colorings in graphs with special degeneracy conditions
- Flexible List Colorings in Graphs with Special Degeneracy Conditions
- Constant-degree graph expansions that preserve treewidth
- Are there any good digraph width measures?
- Directed elimination games
- Improved algorithms and complexity results for power domination in graphs
- Recognizing digraphs of Kelly-width 2
This page was built for publication: Treewidth: Characterizations, Applications, and Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522937)
