Computing hive plots: a combinatorial framework

DOI10.7155/JGAA.V28I2.2990MaRDI QIDQ6636992zbMATH OpenFDO

Authors Martin Nöllenburg, Markus Wallinger

Publication date 12 November 2024

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

combinatorial optimizationgraph drawinghive plots

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Incremental hive graph
• Graph Drawing
• Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
• Drawing graphs by eigenvectors: theory and practice
• Data visualization through graph drawing

Cites work

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• Circular arrangements and cyclic broadcast scheduling
• Computing hive plots: a combinatorial framework
• Cyclic Level Planarity Testing and Embedding
• Cyclic Leveling of Directed Graphs
• Drawing graphs in two layers
• Fast unfolding of communities in large networks
• Global \(k\)-level crossing reduction
• Graph Drawing
• Improved Circular Layouts
• STACS 2004

This page was built for publication: Computing hive plots: a combinatorial framework

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