Finding the shortest bottleneck edge in a parametric minimum spanning tree

MaRDI QIDQ2921758zbMATH OpenFDO

Authors Timothy M. Chan

Publication date 13 October 2014

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1512690
• Minimum spanning trees in networks with varying edge weights
• scientific article; zbMATH DE number 1002204
• Using sparsification for parametric minimum spanning tree problems
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

Cited in

(4)

• The Minimum Moving Spanning Tree Problem
• A stronger lower bound on parametric minimum spanning trees
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• A stronger lower bound on parametric minimum spanning trees

This page was built for publication: Finding the shortest bottleneck edge in a parametric minimum spanning tree

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