The following pages link to (Q4471349):
Displaying 22 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← 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)
- Efficient algorithms for computing Reeb graphs (Q924077) (← links)
- Connectivity calculus of fractal polyhedrons (Q1678685) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Equivalence of edge bicolored graphs on surfaces (Q1753027) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing (Q3611839) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5088964) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- (Q5115795) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5881549) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
