scientific article; zbMATH DE number 2079390
From MaRDI portal
Publication:4471349
zbMATH Open1092.68572MaRDI QIDQ4471349FDOQ4471349
Authors: David Eppstein 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- Layered separators in minor-closed graph classes with applications
- Topologically trivial closed walks in directed surface graphs
- Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Algorithms for the edge-width of an embedded graph
- Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- Efficient algorithms for computing Reeb graphs
- Embedding graphs into two-dimensional simplicial complexes
- Equivalence of edge bicolored graphs on surfaces
- Computing the shortest essential cycle
- A topological approach to dynamic graph connectivity
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- Counting and sampling minimum cuts in genus \(g\) graphs
- Testing graph isotopy on surfaces
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- On the biplanarity of blowups
- Connectivity calculus of fractal polyhedrons
- Title not available (Why is that?)
- Minimum Cuts in Surface Graphs
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
- Dynamic planar embeddings of dynamic graphs
- Title not available (Why is that?)
- Dynamic programming for graphs on surfaces
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)
