A Complexity Dichotomy for Hitting Connected Minors on Bounded Treewidth Graphs: The Chair and the Banner Draw the Boundary

doi 10.1137/1.9781611975994.57
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs

2020English

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Maximum Induced Forests in Graphs of Bounded Treewidth

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

On the Dimension of Posets With Cover Graphs of Treewidth 2

Order
AlgebraGeometryNumber TheoryComputational TheoryMathematicsTopology
2016English

On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy