Minimal Locked Trees

DOI10.1007/978-3-642-03367-4_6zbMATH Open1253.68328DBLPconf/wads/BallingerCDDILP09OpenAlexW1587165042WikidataQ62041821 ScholiaQ62041821MaRDI QIDQ3183441FDOQ3183441

Authors: Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon 

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/61781

Recommendations

• Minimal configuration trees
• Minimal congestion trees
• Minimal spanning forests
• Minimal spanning trees
• Random Minimal Trees
• scientific article; zbMATH DE number 3846542
• Steiner minimal trees
• Minimum spanning trees
• Minimal Huffman trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Acute triangulations of polygons
• Straightening polygonal arcs and convexifying polygonal cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Removing a Ball without Disturbing the Others
• A note on reconfiguring tree linkages: Trees can lock
• Interlocked open and closed linkages with few joints.
• Title not available (Why is that?)
• On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
• Title not available (Why is that?)
• Interlocked open linkages with few joints
• Graph Drawing

Cited In (4)

• A KNOTTED MINIMAL TREE
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimally colored trees

This page was built for publication: Minimal Locked Trees

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