Pages that link to "Item:Q1801672"

The following pages link to Tree-width, path-width, and cutwidth (Q1801672):

Displaying 33 items.

• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
• Neighbourhood-width of trees (Q501055) (← links)
• The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
• On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
• The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
• The treewidth of line graphs (Q723884) (← links)
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
• On 3-cutwidth critical graphs (Q1420615) (← links)
• Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
• Submodular unsplittable flow on trees (Q1801021) (← links)
• On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
• Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
• One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
• Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
• Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
• Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
• Characterizations of \(k\)-cutwidth critical trees (Q2410043) (← links)
• The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
• Submodular Unsplittable Flow on Trees (Q3186514) (← links)
• Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
• (Q5009465) (← links)
• (Q5009556) (← links)
• Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
• The treewidth of 2-section of hypergraphs (Q5024663) (← links)
• Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
• Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
• Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
• Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
• Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
• Slim tree-cut width (Q6586668) (← links)