Pages that link to "Item:Q5249045"
From MaRDI portal
The following pages link to AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH (Q5249045):
Displayed 20 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)
- 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)
- 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)
- (Q5743487) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- Walking through waypoints (Q5918830) (← links)