The following pages link to (Q2934724):
Displaying 6 items.
- 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)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
