π
π
The Cartographer
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
June 12, 2020 Β· Declared Dead Β· π International Symposium Graph Drawing and Network Visualization
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Fabrizio Frati
arXiv ID
2006.06951
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CG,
cs.DM
Citations
15
Venue
International Symposium Graph Drawing and Network Visualization
Last Checked
3 months ago
Abstract
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar rectilinear drawing if the graph admits one.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted