Treewidth. Computations and approximations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Exact algorithms and applications for tree-like Weighted Set Cover
- A linear time algorithm to list the minimal separators of chordal graphs
- A parameterized complexity view on collapsing \(k\)-cores
- Parameterized complexity of conflict-free matchings and paths
- The k‐path vertex cover: General bounds and chordal graphs
- Crossing number for graphs with bounded pathwidth
- The parameterized complexity of the minimum shared edges problem
- scientific article; zbMATH DE number 7278041 (Why is no real title available?)
- Computational aspects of treewidth for graph
- Arboreal Categories: An Axiomatic Theory of Resources
- A parameterized complexity view on collapsing \(k\)-cores
- Parameterized algorithms for the happy set problem
- How to use the minimal separators of a graph for its chordal triangulation
- Mim-width. III. Graph powers and generalized distance domination problems
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Clifford algebras meet tree decompositions
- Separator orders in interval, cocomparability, and AT-free graphs
- Towards fixed-parameter tractable algorithms for abstract argumentation
- scientific article; zbMATH DE number 7310159 (Why is no real title available?)
- On the tree-depth and tree-width in heterogeneous random graphs
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
- A Retrospective on (Meta) Kernelization
- I/O-efficient algorithms for graphs of bounded treewidth
- On computing the Hamiltonian index of graphs
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Using contracted solution graphs for solving reconfiguration problems
- On the hardness of palletizing bins using FIFO queues
- Detecting fixed patterns in chordal graphs in polynomial time
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Principled deep neural network training through linear programming
- Orthogonal planarity testing of bounded treewidth graphs
- Vertex partitioning problems on graphs with bounded tree width
- Weighted maximum-clique transversal sets of graphs
- Minimum dominating set of queens: a trivial programming exercise?
- Weighted modulo orientations of graphs and signed graphs
- Aspmc: new frontiers of algebraic answer set counting
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- scientific article; zbMATH DE number 7525479 (Why is no real title available?)
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- Incremental list coloring of graphs, parameterized by conservation
- On directed covering and domination problems
- On the Parameterized Complexity of the Expected Coverage Problem
- On tradeoffs between width- and fill-like graph parameters
- Counting perfect matchings and the switch chain
- Randomized rumor spreading in poorly connected small-world networks
- A generic convolution algorithm for join operations on tree decompositions
- Collective tree spanners in graphs with bounded parameters
- Dense trees: a new look at degenerate graphs
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- Separator-based graph embedding into multidimensional grids with small edge-congestion
- On the parameterized complexity of the expected coverage problem
- Linear Programs with Conjunctive Database Queries
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
- Complexity and approximation of the constrained forest problem
- Geometric representation of graphs in low dimension using axis parallel boxes
- A sufficiently fast algorithm for finding close to optimal clique trees
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- Characterizations and algorithmic applications of chordal graph embeddings
- The mixed Chinese postman problem parameterized by pathwidth and treedepth
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- The Valve Location Problem in Simple Network Topologies
- On some tractable and hard instances for partial incentives and target set selection
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Discrete optimization methods for group model selection in compressed sensing
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- Large hypertree width for sparse random hypergraphs
- The HOMFLY-PT polynomial is fixed-parameter tractable
- Algorithmic applications of tree-cut width
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- Maximum likelihood thresholds via graph rigidity
- Exploiting Database Management Systems and Treewidth for Counting
- Approximation algorithms for treewidth
- Safe sets in graphs: graph classes and structural parameters
- A \(c^k n\) 5-approximation algorithm for treewidth
- Algebras for tree decomposable graphs
- Safe sets in graphs: graph classes and structural parameters
- A partial k-arboretum of graphs with bounded treewidth
- Acyclic and star colorings of cographs
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- A new approach on locally checkable problems
- New width parameters for SAT and \#SAT
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- Network pollution games
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
- Approximating the bandwidth for asteroidal triple-free graphs
- \((1, j)\)-set problem in graphs
- scientific article; zbMATH DE number 7678043 (Why is no real title available?)
- The robust chromatic number of graphs
- On the parameterized complexity of s-club cluster deletion problems
- On the parameterized complexity of \(s\)-club cluster deletion problems
- New results for network pollution games
- Capacitated domination: problem complexity and approximation algorithms
- Interval degree and bandwidth of a graph
- Triangulating graphs without asteroidal triples
- On treewidth and related parameters of random geometric graphs
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
This page was built for publication: Treewidth. Computations and approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338451)
