Pages that link to "Item:Q1105381"
From MaRDI portal
The following pages link to On finding optimal and near-optimal lineal spanning trees (Q1105381):
Displaying 10 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Resource allocation under limited sharing (Q750312) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- (Q3197844) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves (Q6546606) (← links)