On finding a maximum spanning tree of bounded radius

DOI10.1016/S0166-218X(00)00373-5zbMATH Open0996.05036MaRDI QIDQ5954095

A. I. Serdjukov

Publication date: 6 November 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmspanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On finding a maximum spanning tree of bounded radius