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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
116
click to vote
CSR
2008
Springer
86
views
Theoretical Computer Science
»
more
CSR 2008
»
The saga of minimum spanning trees
15 years 3 months ago
Download
www.elsevier.com
Martin Mares
Real-time Traffic
CSR 2008
|
Theoretical Computer Science
|
claim paper
Related Content
»
LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
»
Minimum congestion spanning trees in planar graphs
»
Hierarchical Minimum Spanning Trees for Lossy Image Set Compression
»
Euclidean boundeddegree spanning tree ratios
»
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
»
Realization of Degree 10 Minimum Spanning Trees in 3Space
»
An antbased algorithm for finding degreeconstrained minimum spanning tree
»
Approximating Minimum MaxStretch spanning Trees on unweighted graphs
»
Computing a MinimumDilation Spanning Tree is NPhard
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2008
Where
CSR
Authors
Martin Mares
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision