Edges and Switches, Tunnels and Bridges

DOI10.1007/978-3-540-73951-7_8zbMATH Open1209.05156OpenAlexW2051809008MaRDI QIDQ3603516FDOQ3603516

Authors: David Eppstein, Elena Mumford, Bettina Speckmann, Marc Van Kreveld 

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_8

Recommendations

• Edges and switches, tunnels and bridges
• Bundled Crossings in Embedded Graphs
• Edge crossings in drawings of bipartite graphs
• Fast edge-routing for large graphs
• DRAWING WITH FAT EDGES

zbMATH Keywords

edge casingdrawingsnonplanar graphsedge crossing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (1)

• Edges and switches, tunnels and bridges

This page was built for publication: Edges and Switches, Tunnels and Bridges

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