Pages that link to "Item:Q5249045"

The following pages link to AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH (Q5249045):

Displaying 30 items.

• Coloring immersion-free graphs (Q326817) (← links)
• The disjoint paths problem in quadratic time (Q412168) (← links)
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
• MSOL restricted contractibility to planar graphs (Q527397) (← links)
• A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
• Online promise problems with online width metrics (Q859981) (← links)
• A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
• A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
• Computing crossing numbers in quadratic time (Q1887712) (← links)
• Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
• Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← links)
• Obtaining a planar graph by vertex deletion (Q2429328) (← links)
• The relative clique-width of a graph (Q2642017) (← links)
• A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
• Faster Computation of Path-Width (Q2819521) (← links)
• Finding good tree decompositions by local search (Q2839209) (← links)
• Finding small separators in linear time via treewidth reduction (Q2933661) (← links)
• Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
• A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs (Q3508562) (← links)
• Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
• Improved Algorithms for the 2-Vertex Disjoint Paths Problem (Q3599102) (← links)
• An Iterative Heuristic Algorithm for Tree Decomposition (Q3625014) (← links)
• (Q4944974) (← links)
• An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
• A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142) (← links)
• (Q5743487) (← links)
• The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
• Walking through waypoints (Q5918830) (← links)
• Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
• A more accurate view of the flat wall theorem (Q6606321) (← links)