„Treewidth“
Suchergebnisse
318 Treffer
-
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs
-
Core Stability in Additively Separable Hedonic Games of Low Treewidth
-
Intersection Graphs with and Without Product Structure
-
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set
-
Steiner Tree Parameterized by Multiway Cut and Even Less
-
Hitting Meets Packing: How Hard Can It Be?
-
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
-
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs
-
Sparse Outerstring Graphs Have Logarithmic Treewidth
-
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
-
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
-
Algorithms and Complexity for Path Covers of Temporal DAGs
-
Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth
-
Faster Treewidth-Based Approximations for Wiener Index
-
A Finite Presentation of Graphs of Treewidth at Most Three
-
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
-
Evaluating Graph Queries Using Semantic Treewidth
-
On Comparable Box Dimension
-
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
-
Enumeration of Minimal Hitting Sets Parameterized by Treewidth