Fast Edge-Routing for Large Graphs

DOI10.1007/978-3-642-11805-0_15zbMath1284.68458MaRDI QIDQ3557874

Lev Nachmanson, Tim Dwyer

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

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Related Items

Edge routing with ordered bundles, Edge Routing with Ordered Bundles