Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
37
click to vote
CCCG
2006
favorite
Email
discuss
report
133
views
Computational Geometry
»
more
CCCG 2006
»
Realization of Degree 10 Minimum Spanning Trees in 3-Space
14 years 8 days ago
Download
www.cs.mcgill.ca
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
James A. King
Real-time Traffic
CCCG 2006
|
CCCG 2007
|
Maximum Degree
|
Minimum Spanning Tree
|
claim paper
Related Content
»
Approximating minimum bounded degree spanning trees to within one of optimal
»
Approximating the Minimum Spanning Tree Weight in Sublinear Time
»
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2006
Where
CCCG
Authors
James A. King
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision