Point-set embeddings of trees with given partial drawings
From MaRDI portal
Publication:924086
DOI10.1016/j.comgeo.2009.01.001zbMath1182.05086OpenAlexW2048913517WikidataQ62042545 ScholiaQ62042545MaRDI QIDQ924086
Walter Didimo, Stephen K. Wismath, Giuseppe Liotta, Henk G. Meijer, Emilio Di Giacomo
Publication date: 27 July 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.01.001
Related Items (10)
Alternating paths and cycles of minimum length ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Universal point sets for 2-coloured trees ⋮ Compatible spanning trees ⋮ \(\beta\)-stars or on extending a drawing of a connected subgraph ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Inserting one edge into a simple drawing is hard ⋮ Planar straight-line point-set embedding of trees with partial embeddings ⋮ Constrained Point Set Embedding of a Balanced Binary Tree ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the thickness of graphs of given degree
- The rooted tree embedding problem into points in the plane
- On embedding an outer-planar graph in a point set
- On a straight-line embedding problem of graphs
- Straight line embeddings of rooted star forests in the plane
- k-Colored Point-Set Embeddability of Outerplanar Graphs
- Drawing Colored Graphs on Colored Points
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Drawing graphs. Methods and models
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Point-set embeddings of trees with given partial drawings
