Optimization of spanning tree stretch and congestion for graphs

DOI10.1360/SSM-2019-0266MaRDI QIDQ5064228zbMATH OpenFDO

Authors Yanpei Liu

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/SSM-2019-0266

zbMATH Keywords

congestiondilationfundamental cocyclefundamental cyclespanning tree optimization

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27)

Recommendations

• Optimality computation of the minimum stretch spanning tree problem
• The minimum stretch spanning tree problem for typical graphs
• On spanning tree congestion of graphs
• Minimum congestion spanning trees in planar graphs
• Optimality characterization of the minimum stretch spanning tree problem for interval graphs

Cited in

(6)

• The minimum stretch spanning tree problem for typical graphs
• Optimality computation of the minimum stretch spanning tree problem
• Optimality characterization of the minimum stretch spanning tree problem for interval graphs
• A Survey on Spanning Tree Congestion
• scientific article; zbMATH DE number 2188361 (Why is no real title available?)
• The minimum centroid branch spanning tree problem

This page was built for publication: Optimization of spanning tree stretch and congestion for graphs

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