Growing a Tree from Its Branches
From MaRDI portal
Recommendations
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
- Every set of disjoint line segments admits a binary tree
- Pointed binary encompassing trees
- 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)