SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS

DOI10.1142/S0218195905001671MaRDI QIDQ5696537zbMATH OpenOpenAlexFDO

Authors Atsushi Kaneko, Mikio Kano

Publication date 18 October 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195905001671

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Straight-line embeddings of two rooted trees in the plane
• The rooted tree embedding problem into points in the plane
• Bipartite embeddings of trees in the plane
• scientific article; zbMATH DE number 1786511
• scientific article; zbMATH DE number 431516

Cites work

• On a straight-line embedding problem of graphs
• Straight line embeddings of rooted star forests in the plane
• Straight-line embeddings of two rooted trees in the plane
• The rooted tree embedding problem into points in the plane

Cited in

(10)

• Near equipartitions of colored point sets
• Discrete geometry on colored point sets in the plane -- a survey
• Improved algorithms for the point-set embeddability problem for plane 3-trees
• Balanced subdivisions with boundary condition of two sets of points in the plane
• Constrained point-set embeddability of planar graphs
• Alternating paths and cycles of minimum length
• Constrained Point-Set Embeddability of Planar Graphs
• Universal point sets for 2-coloured trees
• A linear-time approximation algorithm for the minimum-length geometric embedding of trees
• Point-set embeddings of trees with given partial drawings

This page was built for publication: SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696537)