A New Framework for Hierarchical Drawings
From MaRDI portal
Publication:5233135
DOI10.7155/jgaa.00502zbMath1419.05150OpenAlexW2972831716WikidataQ127291337 ScholiaQ127291337MaRDI QIDQ5233135
Giacomo Ortali, Ioannis. G. Tollis
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00502
Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Computing a feedback arc set using PageRank, Effective Computation of a Feedback Arc Set Using PageRank
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge crossings in drawings of bipartite graphs
- A flow formulation for horizontal coordinate assignment with prescribed width
- A decomposition theorem for partially ordered sets
- Algorithms and Bounds for Overloaded Orthogonal Drawings
- Confluent Orthogonal Drawings of Syntax Diagrams
- Improving Layered Graph Layouts with Edge Bundling
- An open graph visualization system and its applications to software engineering
- Graphlet: design and implementation of a graph editor
- Max flows in O(nm) time, or better
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Graph Drawing
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Drawing graphs. Methods and models
