scientific article; zbMATH DE number 1305491

MaRDI QIDQ4252380zbMATH OpenFDO

Authors Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann

Publication date 17 October 2000

zbMATH Keywords

connected graphspanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1563034
• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
• Arbres avec un nombre maximum de sommets pendants
• scientific article; zbMATH DE number 1420489

Cited in

(6)

• The 2-hop spanning tree problem
• The maximum \(f\)-depth spanning tree problem
• Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
• Approximating spanning trees with few branches
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252380)