scientific article; zbMATH DE number 1285634

MaRDI QIDQ4242391zbMATH OpenFDO

Authors A. I. Serdyukov

Publication date 10 May 1999

zbMATH Keywords

algorithmNP-hardsearchingspanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Programming involving graphs or networks (90C35)

Recommendations

• On finding a maximum spanning tree of bounded radius
• scientific article; zbMATH DE number 4097419
• A probabilistic analysis of an approximation algorithm for the minimum weight spanning tree problem with bounded from below diameter
• scientific article; zbMATH DE number 731844
• On the approximability of some maximum spanning tree problems

Cited in

(3)

• On the Red/Blue Spanning Tree Problem
• scientific article; zbMATH DE number 4097419 (Why is no real title available?)
• On finding a maximum spanning tree of bounded radius

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 Q4242391)