The following pages link to (Q2934586):
Displaying 9 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- From the plane to higher surfaces (Q444375) (← 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)
- Computing the shortest essential cycle (Q603870) (← links)
- The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing (Q640484) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- (Q5743478) (← links)
- Many distances in planar graphs (Q5920250) (← links)
