Pages that link to "Item:Q4033754"
From MaRDI portal
The following pages link to On Linear Time Minor Tests with Depth-First Search (Q4033754):
Displayed 11 items.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (Q4876371) (← links)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)