On selecting leaves with disjoint neighborhoods in embedded trees

DOI10.1007/978-3-030-11509-8_16MaRDI QIDQ2326573zbMATH OpenOpenAlexFDO

Authors Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-11509-8_16

zbMATH Keywords

linear-time algorithmneighborhoodtreeVoronoi diagram

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• scientific article; zbMATH DE number 475595
• Every set of disjoint line segments admits a binary tree
• Disk embeddings of planar graphs
• The rooted tree embedding problem into points in the plane
• Straight-line embeddings of two rooted trees in the plane

Cited in

(1)

• On selecting a fraction of leaves with disjoint neighborhoods in a plane tree

This page was built for publication: On selecting leaves with disjoint neighborhoods in embedded trees

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