Minimum congestion spanning trees in bipartite and random graphs

DOI10.1016/S0252-9602(11)60263-4MaRDI QIDQ655852zbMATH OpenFDO

Authors Mikhail Ostrovskii

Publication date 27 January 2012

Published in Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

zbMATH Keywords

random graphbipartite graphminimum congestion spanning tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On spanning tree congestion of graphs
• Minimal congestion trees
• Minimum congestion spanning trees in planar graphs
• On tree congestion of graphs
• Complexity results for the spanning tree congestion problem

Cited in

(7)

• Minimum congestion spanning trees in planar graphs
• Finding minimum congestion spanning trees
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Spanning tree congestion of rook's graphs
• Spanning tree congestion and computation of generalized Győri-Lovász partition
• A Survey on Spanning Tree Congestion

This page was built for publication: Minimum congestion spanning trees in bipartite and random graphs

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