Graph minors. II. Algorithmic aspects of tree-width
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- A spectral lower bound for the treewidth of a graph and its consequences
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- On tree-partition-width
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Computational properties of argument systems satisfying graph-theoretic constraints
- Computational study on planar dominating set problem
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- Pathwidth of cubic graphs and exact algorithms
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- Grids and their minors
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On minimum dominating sets with minimum intersection
- Decomposing infinite graphs
- Precoloring extension. I: Interval graphs
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Diagonalization, uniformity, and fixed-point theorems
- General vertex disjoint paths in series-parallel graphs
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
- A partial k-arboretum of graphs with bounded treewidth
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- Forests, colorings and acyclic orientations of the square lattice
- On hyperedge replacement and BNLC graph grammars
- On the pathwidth of chordal graphs
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Graph searching and a min-max theorem for tree-width
- Improved self-reduction algorithms for graphs with bounded treewidth
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree
- \(k\)-NLC graphs and polynomial algorithms
- Rooted routing in the plane
- Generalized coloring for tree-like graphs
- Treewidth for graphs with small chordality
- Characterizations and algorithmic applications of chordal graph embeddings
- Minimum self-repairing graphs
- The complexity of broadcasting in planar and decomposable graphs
- Triangulating multitolerance graphs
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Branch-width and Rota's conjecture
- Approximating the treewidth of AT-free graphs.
- Splitting a graph into disjoint induced paths or cycles.
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- Chordal embeddings of planar graphs
- Tree-width, clique-minors, and eigenvalues.
- Generating irregular partitionable data structures
- Algorithms for generalized vertex-rankings of partial k-trees
- A comparison of structural CSP decomposition methods
- Counting \(H-\)colorings of partial \(k-\)trees
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Listing all potential maximal cliques of a graph
- Perfect edge domination and efficient edge domination in graphs
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Eigenvalue location in graphs of small clique-width
- Obstructions to a small hyperbolicity in Helly graphs
- Induced and weak induced arboricities
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Track layouts, layered path decompositions, and leveled planarity
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Algorithm to find a maximum 2-packing set in a cactus
- The critical node detection problem in networks: a survey
- A branch-and-price-and-cut method for computing an optimal bramble
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Diameter and treewidth in minor-closed graph families, revisited
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Querying linguistic treebanks with monadic second-order logic in linear time
- On \textsf{NC} algorithms for problems on bounded rank-width graphs
- Tree-width, path-width, and cutwidth
- An approximation algorithm for computing longest paths.
- Surfaces, tree-width, clique-minors, and partitions
- High-girth graphs avoiding a minor are nearly bipartite
- \(K_{a,k}\) minors in graphs of bounded tree-width
- On matroids of branch-width three.
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Fork-decompositions of matroids
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- Algebraic approach to fasciagraphs and rotagraphs
- Improved Steiner tree algorithms for bounded treewidth
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Approximation algorithms via contraction decomposition
- Structured probabilistic inference
- Trimming of graphs, with application to point labeling
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
- On the complexity of computing treebreadth
- On tradeoffs between width- and fill-like graph parameters
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Representing graphs as the intersection of cographs and threshold graphs
- Beating treewidth for average-case subgraph isomorphism
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Notes on graph product structure theory
- Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
- Orthogonal planarity testing of bounded treewidth graphs
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Fast and parallel decomposition of constraint satisfaction problems
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)
