Upward straight-line embeddings of directed graphs into point sets
Authors:
- Carla BinucciCBCarla Binucci
- Emilio Di GiacomoEGEmilio Di Giacomo
- Walter DidimoWDWalter Didimo
- Alejandro Estrella-BalderramaAEAlejandro Estrella-Balderrama
- Fabrizio FratiFFFabrizio Frati
- Stephen G. KobourovSKStephen G. Kobourov
- Giuseppe LiottaGLGiuseppe Liotta
- 1 February 2010
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 43 (2) , 219-232
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Upward Straight-Line Embeddings of Directed Graphs into Point SetsLecture Notes in Computer Science, 2008
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs2006
- Book Embeddability of Series–Parallel DigraphsAlgorithmica, 2006
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hardJournal of Graph Algorithms and Applications, 2006
- On embedding an outer-planar graph in a point setComputational Geometry, 2002
- Optimal Algorithms to Embed Trees in a Point SetJournal of Graph Algorithms and Applications, 1997
- Area requirement and symmetry display of planar upward drawingsDiscrete & Computational Geometry, 1992
- How to draw a planar graph on a gridCombinatorica, 1990
- A lower bound on the size of universal sets for planar graphsACM SIGACT News, 1989
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988