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
13
click to vote
DM
2006
favorite
Email
discuss
report
61
views
more
DM 2006
»
A degree bound on decomposable trees
13 years 8 months ago
Download
www.prism.uvsq.fr
Dominique Barth, Hervé Fournier
Real-time Traffic
DM 2006
|
claim paper
Related Content
»
BoundedDegree Techniques Accelerate Some Parameterized Graph Algorithms
»
Bounded Degree Closest kTree Power Is NPComplete
»
Minimum Bounded Degree Spanning Trees
»
Resource Allocation in Bounded Degree Trees
»
Partitions and Coverings of Trees by BoundedDegree Subtrees
»
Approximating minimum bounded degree spanning trees to within one of optimal
»
Degree Bounded Spanning Trees
»
Graph Inference from a Walk for TRees of Bounded Degree 3 is NPComplete
»
Embedding nearlyspanning bounded degree trees
more »
Post Info
More Details (n/a)
Added
11 Dec 2010
Updated
11 Dec 2010
Type
Journal
Year
2006
Where
DM
Authors
Dominique Barth, Hervé Fournier
Comments
(0)
Researcher Info
DM 1998 Study Group
Computer Vision