Improving layered graph layouts with edge bundling

DOI10.1007/978-3-642-18469-7_30zbMATH Open1314.68239OpenAlexW1513389131MaRDI QIDQ3073683FDOQ3073683

Authors: Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann 

Publication date: 11 February 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_30

Recommendations

• Edge routing with ordered bundles
• Edge routing with ordered bundles
• Bundled crossings revisited
• Stub bundling and confluent spirals for geographic networks
• MLSEB: edge bundling using moving least squares approximation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (13)

• Algorithms and bounds for drawing directed graphs
• Column-based graph layouts
• Representing permutations with few moves
• A new framework for hierarchical drawings
• Column-based graph layouts
• Edge routing with ordered bundles
• Edge routing with ordered bundles
• Peacock bundles: bundle coloring for graphs with globality-locality trade-off
• Graph layouts via layered separators
• TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
• Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
• Stub bundling and confluent spirals for geographic networks
• MLSEB: edge bundling using moving least squares approximation

This page was built for publication: Improving layered graph layouts with edge bundling

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