Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

63

Voted

DM
2006

61views more DM 2006»

A degree bound on decomposable trees

15 years 2 months ago

A degree bound on decomposable trees

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

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)