Algorithms and bounds for drawing directed graphs
From MaRDI portal
Publication:1725793
DOI10.1007/978-3-030-04414-5_41OpenAlexW2889363686MaRDI QIDQ1725793
Giacomo Ortali, Ioannis. G. Tollis
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.10364
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Edge crossings in drawings of bipartite graphs
- Algorithms and bounds for drawing directed graphs
- 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
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Drawing graphs. Methods and models
