Edge Routing with Ordered Bundles

DOI10.1007/978-3-642-25878-7_14zbMath1311.68124arXiv1209.4227OpenAlexW1793674997MaRDI QIDQ3223949

Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4227

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Edge routing with ordered bundles, Representing Permutations with Few Moves

Cites Work

• Unnamed Item
• Improving Layered Graph Layouts with Edge Bundling
• Fast Edge-Routing for Large Graphs
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• Improved Circular Layouts
• Drawing Graphs with GLEE