Pages that link to "Item:Q1028460"
From MaRDI portal
The following pages link to Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460):
Displaying 11 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- A simple algorithm for replacement paths problem (Q327668) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Accelerated Bend Minimization (Q5895514) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)