Edges and switches, tunnels and bridges
From MaRDI portal
Publication:1028235
DOI10.1016/j.comgeo.2008.05.005zbMath1214.05091OpenAlexW2763737287WikidataQ59782325 ScholiaQ59782325MaRDI QIDQ1028235
Bettina Speckmann, Elena Mumford, David Eppstein, Marc J. van Kreveld
Publication date: 30 June 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.05.005
Related Items (5)
The Stub Resolution of 1-planar Graphs ⋮ Gap-Planar Graphs ⋮ Gap-planar graphs ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Crossing Layout in Non-planar Graph Drawings
Cites Work
- Unnamed Item
- Two-coloring the faces of arrangements
- Minimizing maximum indegree
- Weaving patterns of lines and line segments in space
- Planar Formulae and Their Uses
- On the Complexity of Timetable and Multicommodity Flow Problems
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Faster scaling algorithms for general graph matching problems
- A graph-theoretic via minimization algorithm for two-layer printed circuit boards
- Algorithmic Aspects of Proportional Symbol Maps
This page was built for publication: Edges and switches, tunnels and bridges