Computing hive plots: a combinatorial framework

DOI10.7155/JGAA.V28I2.2990MaRDI QIDQ6636992FDOQ6636992

Authors: Martin Nöllenburg, Markus Wallinger 

Publication date: 12 November 2024

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

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

zbMATH Keywords

combinatorial optimizationgraph drawinghive plots

Mathematics Subject Classification ID

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

Cites Work

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

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)