scientific article; zbMATH DE number 1534497

MaRDI QIDQ4517274zbMATH OpenFDO

Authors Eh. Kh. Gimadi, A. I. Serdyukov

Publication date 21 November 2000

zbMATH Keywords

dynamic programmingNP-hardness problemspanning tree

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cited in

(3)

• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• scientific article; zbMATH DE number 3978859 (Why is no real title available?)
• scientific article; zbMATH DE number 540118 (Why is no real title available?)

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