scientific article; zbMATH DE number 2079390

MaRDI QIDQ4471349zbMATH OpenFDO

Authors David Eppstein

Publication date 28 July 2004

zbMATH Keywords

embedding surface

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic graph embeddings
• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• A topological approach to dynamic graph connectivity

Cited in

(33)

• A topological approach to dynamic graph connectivity
• 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
• 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
• 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
• Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
• Topologically trivial closed walks in directed surface graphs
• A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
• Embedding graphs into two-dimensional simplicial complexes
• Dynamic programming for graphs on surfaces
• scientific article; zbMATH DE number 7662167 (Why is no real title available?)
• Minimum Cuts in Surface Graphs
• Computing the shortest essential cycle
• Good \(r\)-divisions imply optimal amortized decremental biconnectivity
• On the biplanarity of blowups
• Computing shortest closed curves on non-orientable surfaces
• Totally geodesic surfaces in hyperbolic 3-manifolds: algorithms and examples
• Good r-divisions imply optimal amortized decremental biconnectivity
• An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
• Fully-adaptive dynamic connectivity of square intersection graphs
• Making multicurves cross minimally on surfaces
• Dynamic embeddings of dynamic single-source upward planar graphs
• Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
• Period matrices and homological quasi-trees on discrete Riemann surfaces
• A unified FPT framework for crossing number problems
• Efficient algorithms for computing Reeb graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471349)