A given diameter MST on a random graph

DOI10.1007/978-3-030-62867-3_9MaRDI QIDQ2679776zbMATH OpenOpenAlexFDO

Authors Eh. Kh. Gimadi, Aleksandr S. Shevyakov, Alexandr A. Shtepa

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/978-3-030-62867-3_9

zbMATH Keywords

approximation algorithmgiven-diameter minimum spanning treeprobabilistic analysis

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1594512
• Random-tree diameter and the diameter-constrained MST
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• Random-tree Diameter and the Diameter-constrained MST
• On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights

Cited in

(9)

• On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights
• scientific article; zbMATH DE number 1594512 (Why is no real title available?)
• Random-tree diameter and the diameter-constrained MST
• Stochastic bounded diameter minimum spanning tree problem
• Almost Every Randomly Near-Traceable Graph has Diameter at Most Two
• Random-tree Diameter and the Diameter-constrained MST
• On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter
• Edge-disjoint spanning trees of arbitrary bounded diameter on random inputs
• Several edge-disjoint spanning trees with given diameter in a graph with random discrete edge weights

This page was built for publication: A given diameter MST on a random graph

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