Graph minors. II. Algorithmic aspects of tree-width
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Target Set Selection in Dense Graph Classes
- Probabilistic logic with independence
- Exact algorithms and applications for tree-like Weighted Set Cover
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Positive-instance driven dynamic programming for treewidth
- Tree-coloring problems of bounded treewidth graphs
- The word problem for free adequate semigroups.
- Locating Facilities on a Network to Minimize Their Average Service Radius
- Directed NLC-width
- The pagenumber of \(k\)-trees is \(O(k)\)
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Treewidth of graphs with balanced separations
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On the complexity of winner determination and strategic control in conditional approval voting
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Logical aspects of Cayley-graphs: the group case
- Computational aspects of treewidth for graph
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- An efficient partitioning oracle for bounded-treewidth graphs
- Strong NP-hardness of AC power flows feasibility
- Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- Sparse graphs of twin-width 2 have bounded tree-width
- Non-deterministic graph searching in trees
- Weighted connected matchings
- scientific article; zbMATH DE number 7731184 (Why is no real title available?)
- Efficient sets in partial \(k\)-trees
- The structure of the models of decidable monadic theories of graphs
- Towards fixed-parameter tractable algorithms for abstract argumentation
- scientific article; zbMATH DE number 795221 (Why is no real title available?)
- Layered separators in minor-closed graph classes with applications
- On the tree-depth and tree-width in heterogeneous random graphs
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- Quantitative graph theory: a new branch of graph theory and network science
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Precoloring extension. I: Interval graphs
- Acyclic coloring parameterized by directed clique-width
- Contraction bidimensionality of geometric intersection graphs
- Constructing tree decompositions of graphs with bounded gonality
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Minimum vertex cover in rectangle graphs
- Thread graphs, linear rank-width and their algorithmic applications
- An exact method for graph coloring
- Are there any good digraph width measures?
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Treewidth, crushing and hyperbolic volume
- Decomposability helps for deciding logics of knowledge and belief
- Principled deep neural network training through linear programming
- Algorithms and bounds for very strong rainbow coloring
- Orthogonal planarity testing of bounded treewidth graphs
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- Heuristic and metaheuristic methods for computing graph treewidth
- Tree decomposition and discrete optimization problems: a survey
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Treewidth governs the complexity of target set selection
- \(\mathcal{P}\)-matchings parameterized by treewidth
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- Control of Some Graph Invariants in Dynamic Routing
- Parameterized complexity of maximum happy set and densest \(k\)-subgraph
- Connected graph searching in chordal graphs
- Disjoint paths in sparse graphs
- Packing disjoint cycles over vertex cuts
- scientific article; zbMATH DE number 5874803 (Why is no real title available?)
- On compact and efficient routing in certain graph classes
- On computational complexity of graph inference from counting
- Structural tractability of counting of solutions to conjunctive queries
- On the complexity of constrained Nash equilibria in graphical games
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- Linearity of grid minors in treewidth with applications through bidimensionality
- On the vertex cover \(P_3\) problem parameterized by treewidth
- On the complexity of some subgraph problems
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Excluding a planar matching minor in bipartite graphs
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
- Treewidth versus clique number. II: Tree-independence number
- Treewidth computations. II. Lower bounds
- Algorithms for generalized vertex-rankings of partial k-trees
- Improved bounds for the excluded-minor approximation of treedepth
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Powers of planar graphs, product structure, and blocking partitions
- Product structure of graph classes with bounded treewidth
- Tractable counting of the answers to conjunctive queries
- Local tree-width, excluded minors, and approximation algorithms
- Approximating the treewidth of AT-free graphs.
- Track layouts, layered path decompositions, and leveled planarity
- Courcelle's theorem -- a game-theoretic approach
- The disjoint paths problem in quadratic time
- \(k\)-NLC graphs and polynomial algorithms
- On tradeoffs between width- and fill-like graph parameters
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Trimming weighted graphs of bounded treewidth
- On switching classes, NLC-width, cliquewidth and treewidth
- A hybrid tractable class for non-binary CSPs
- On listing, sampling, and counting the chordal graphs with edge constraints
- Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Bounded-degree planar graphs do not have bounded-degree product structure
- Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
This page was built for publication: Graph minors. II. Algorithmic aspects of tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751592)
