Minimum congestion spanning trees in bipartite and random graphs

DOI10.1016/S0252-9602(11)60263-4zbMath1240.05050MaRDI QIDQ655852

Mikhail I. Ostrovskii

Publication date: 27 January 2012

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

zbMATH Keywords

bipartite graphrandom graphminimum congestion spanning tree

Mathematics Subject Classification ID

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

Related Items (2)

A Survey on Spanning Tree Congestion ⋮ Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition

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