Fast edge-routing for large graphs

DOI10.1007/978-3-642-11805-0_15MaRDI QIDQ3557874zbMATH OpenOpenAlexFDO

Authors Tim Dwyer, Lev Nachmanson

Publication date 27 April 2010

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11805-0_15

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Curved edge routing
• Integrating Edge Routing into Force-Directed Layout
• A Fast Multi-Scale Method for Drawing Large Graphs
• Edge routing with ordered bundles
• Graph Drawing

Cited in

(11)

• Edges and switches, tunnels and bridges
• Edge routing with ordered bundles
• Drawing with fat edges
• Edge routing with ordered bundles
• Integrating Edge Routing into Force-Directed Layout
• Edges and Switches, Tunnels and Bridges
• Fast layout methods for timetable graphs
• Curved edge routing
• DRAWING WITH FAT EDGES
• Graph Drawing
• Setting port numbers for fast graph exploration

This page was built for publication: Fast edge-routing for large graphs

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