Point-Set Embeddability of 2-Colored Trees

DOI10.1007/978-3-642-36763-2_26zbMath1377.68175OpenAlexW1769402330WikidataQ62042435 ScholiaQ62042435MaRDI QIDQ4912211

Tamara Mchedlidze, Marc Glisse, Rahnuma Islam Nishat, Fabrizio Frati, Giuseppe Liotta, William J. Lenhart

Publication date: 3 April 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36763-2_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Alternating paths and cycles of minimum length ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

This page was built for publication: Point-Set Embeddability of 2-Colored Trees