Growing a Tree from Its Branches

DOI10.1006/JAGM.1995.1028MaRDI QIDQ4840220zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Godfried Toussaint

Publication date 10 September 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a133a477e5b47112375bd89c78aebb25a06a01ed

zbMATH Keywords

encompassing tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Every set of disjoint line segments admits a binary tree
• scientific article; zbMATH DE number 1555917
• Pointed and colored binary encompassing trees
• Minimum spanning tree of line segments
• Pointed binary encompassing trees: simple and optimal

Cited in

(17)

• Planar bichromatic minimum spanning trees
• Spanning trees crossing few barriers
• Minimum spanning tree of line segments
• Compatible spanning trees
• Encompassing colored planar straight line graphs
• A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
• Tight bounds for connecting sites across barriers
• An open ended tree
• scientific article; zbMATH DE number 1555917 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• Pointed and colored binary encompassing trees
• THE MINIMUM GUARDING TREE PROBLEM
• On the visibility graph of convex translates
• Construction of the developing connecting tree
• Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
• Pointed binary encompassing trees: simple and optimal
• Vertex-colored encompassing graphs

This page was built for publication: Growing a Tree from Its Branches

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