Upward point set embeddings of paths and trees

DOI10.1007/978-3-030-68211-8_19OpenAlexW3135582759MaRDI QIDQ2232250

Tamara Mchedlidze, Linda Kleist, Pilar Cano, Irene Parada, Saeed Mehrabi, Elena Arseneva, Pavel Valtr

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2012.10525

zbMATH Keywords

treeupper bounddigraphNP-completenesscountingdirected graphpathcaterpillarupward planarity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
• Upward straight-line embeddings of directed graphs into point sets
• Algorithms for plane representations of acyclic digraphs
• On embedding an outer-planar graph in a point set
• On upward point set embeddability
• Bemerkungen zum Vierfarbenproblem
• Upward Geometric Graph Embeddings into Point Sets
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Optimal Algorithms to Embed Trees in a Point Set
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Convex Maps

This page was built for publication: Upward point set embeddings of paths and trees