Approximating spanning tree congestion on graphs with polylog degree

DOI10.1007/978-3-031-63021-7_38MaRDI QIDQ7021069zbMATH OpenFDO

Authors Petr Kolman

Publication date 28 February 2025

zbMATH Keywords

congestionspanning treebisectiongraph sparsification

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Approximating spanning tree congestion on graphs with polylog degree

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