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
12
click to vote
IPPS
2003
IEEE
favorite
Email
discuss
report
115
views
Distributed And Parallel Com...
»
more
IPPS 2003
»
The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
13 years 9 months ago
Download
www.ibisc.univ-evry.fr
Lélia Blin, Franck Butelle
Real-time Traffic
Distributed And Parallel Computing
|
IPPS 2003
|
claim paper
Related Content
»
Approximating minimum bounded degree spanning trees to within one of optimal
»
Primaldual meets local search approximating MSTs with nonuniform degree bounds
»
Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem
»
The Directed MinimumDegree Spanning Tree Problem
»
Spanning trees with minimum weighted degrees
»
A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...
»
Approximating Spanning Trees with Inner Nodes Cost
»
A 53Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
»
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
more »
Post Info
More Details (n/a)
Added
04 Jul 2010
Updated
04 Jul 2010
Type
Conference
Year
2003
Where
IPPS
Authors
Lélia Blin, Franck Butelle
Comments
(0)
Researcher Info
Distributed And Parallel Computing Study Group
Computer Vision