Graph minors. II. Algorithmic aspects of tree-width
From MaRDI portal
Publication:3751592
Recommendations
Cited in
(only showing first 100 items - show all)- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Dynamic algorithms for graphs of bounded treewidth
- Perfect edge domination and efficient edge domination in graphs
- Recent developments on graphs of bounded clique-width
- On computational complexity of graph inference from counting
- Structural tractability of counting of solutions to conjunctive queries
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- Algebraic approach to fasciagraphs and rotagraphs
- To approximate treewidth, use treelength!
- Dynamic Management of Heuristics for Solving Structured CSPs
- Graph minors. I. Excluding a forest
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
- Graph minors. III. Planar tree-width
- Courcelle's theorem -- a game-theoretic approach
- The critical node detection problem in networks: a survey
- The disjoint paths problem in quadratic time
- Minimal triangulations of graphs: a survey
- Fifty years of the spectrum problem: survey and new results
- The inverse 1-maxian problem with edge length modification
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- On bounded-degree vertex deletion parameterized by treewidth
- An exact method for graph coloring
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Hypertree decompositions and tractable queries
- Practical algorithms on partial k-trees with an application to domination-like problems
- A hybrid tractable class for non-binary CSPs
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- A coloring problem for weighted graphs
- Approximation algorithms for treewidth
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Are there any good digraph width measures?
- Recognizability equals definability for partial k-paths
- Digraph width measures in parameterized algorithmics
- Listing all potential maximal cliques of a graph
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Treewidth computations. I: Upper bounds
- Algorithms for solving problems on graphs of bounded pathwidth
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- Treewidth for graphs with small chordality
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Treewidth governs the complexity of target set selection
- A spectral lower bound for the treewidth of a graph and its consequences
- Monotonicity of non-deterministic graph searching
- Approximation algorithms for maximum two-dimensional pattern matching
- Approximating the spanning \(k\)-tree forest problem
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Surfaces, tree-width, clique-minors, and partitions
- Rank-width and tree-width of \(H\)-minor-free graphs
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Computational properties of argument systems satisfying graph-theoretic constraints
- A comparison of structural CSP decomposition methods
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- The Potts model and the Tutte polynomial.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Graph minors. V. Excluding a planar graph
- Approximate tree decompositions of planar graphs in linear time
- Computational study on planar dominating set problem
- A logical approach to multicut problems
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- The relative clique-width of a graph
- Transforming graph states using single-qubit operations
- Representing graphs as the intersection of cographs and threshold graphs
- Branch-width and Rota's conjecture
- A partial k-arboretum of graphs with bounded treewidth
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Forests, colorings and acyclic orientations of the square lattice
- On the pathwidth of chordal graphs
- Splitting a graph into disjoint induced paths or cycles.
- Pathwidth of cubic graphs and exact algorithms
- Approximate tree decompositions of planar graphs in linear time
- New analysis and computational study for the planar connected dominating set problem
- Tree-depth, subgraph coloring and homomorphism bounds
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- scientific article; zbMATH DE number 2080246 (Why is no real title available?)
- Treewidth computation and extremal combinatorics
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- Approximating the pathwidth of outerplanar graphs
- Graph searching and a min-max theorem for tree-width
- Contraction obstructions for connected graph searching
- Community structure inspired algorithms for SAT and \#SAT
- Monotony properties of connected visible graph searching
- An improved algorithm for finding tree decompositions of small width
- Non-deterministic graph searching in trees
- Tractable counting of the answers to conjunctive queries
- Spanners for bounded tree-length graphs
- Tree-width and planar minors
- Structured probabilistic inference
- New limits of treewidth-based tractability in optimization
- Finding paths in grids with forbidden transitions
- 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
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Eigenvalue location in graphs of small clique-width
- Induced and weak induced arboricities
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)
