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