The following pages link to Graph Drawing (Q5896899):
Displaying 6 items.
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- (Q2753952) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)