scientific article; zbMATH DE number 2079390

zbMath1092.68572MaRDI QIDQ4471349

David Eppstein

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

embedding surface

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (22)

Minimum Cuts in Surface Graphs ⋮ Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Computing the shortest essential cycle ⋮ Layered separators in minor-closed graph classes with applications ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Connectivity calculus of fractal polyhedrons ⋮ Dynamic planar embeddings of dynamic graphs ⋮ Algorithms for the edge-width of an embedded graph ⋮ Unnamed Item ⋮ Testing graph isotopy on surfaces ⋮ Efficient algorithms for computing Reeb graphs ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Equivalence of edge bicolored graphs on surfaces ⋮ Unnamed Item ⋮ The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing ⋮ Fast and compact planar embeddings ⋮ Unnamed Item ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs ⋮ Dynamic programming for graphs on surfaces

This page was built for publication: