Upward Point Set Embeddings of Paths and Trees
- 16 February 2021
- book chapter
- Published by Springer Nature
- p. 234-246
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Reprint of: Upward planar embedding of an n -vertex oriented path onpointsComputational Geometry, 2014
- On upward point set embeddabilityComputational Geometry, 2013
- Upward Geometric Graph Embeddings into Point Sets2011
- Upward straight-line embeddings of directed graphs into point setsComputational Geometry, 2010
- 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
- E3341The American Mathematical Monthly, 1991
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975