Growing a Tree from Its Branches

DOI10.1006/jagm.1995.1028zbMath0836.68078OpenAlexW2150475707MaRDI QIDQ4840220

Godfried T. Toussaint, Prosenjit Bose

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)

Related Items (7)

A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS ⋮ Compatible spanning trees ⋮ Encompassing colored planar straight line graphs ⋮ On the visibility graph of convex translates ⋮ Pointed binary encompassing trees: simple and optimal ⋮ Vertex-colored encompassing graphs ⋮ Planar bichromatic minimum spanning trees

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