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

DOI10.1142/S0218195905001671zbMath1104.68122OpenAlexW2140036258MaRDI QIDQ5696537

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)

Related Items (9)

IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Alternating paths and cycles of minimum length ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Near equipartitions of colored point sets ⋮ Universal point sets for 2-coloured trees ⋮ Point-set embeddings of trees with given partial drawings ⋮ BALANCED SUBDIVISIONS WITH BOUNDARY CONDITION OF TWO SETS OF POINTS IN THE PLANE ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Constrained Point-Set Embeddability of Planar Graphs

Cites Work

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

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