Designing low-congestion networks with structural graph theory

DOI10.4036/IIS.2011.197zbMATH Open1247.68199OpenAlexW2112753695MaRDI QIDQ2908593FDOQ2908593

Authors: Yota Otachi 

Publication date: 5 September 2012

Published in: Interdisciplinary Information Sciences (IIS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2011.197

Recommendations

• scientific article; zbMATH DE number 3950393
• Minor excluded network families admit fast distributed algorithms
• Minimal congestion trees
• Near-optimal low-congestion shortcuts on bounded parameter graphs
• scientific article; zbMATH DE number 2080246

zbMATH Keywords

graph algorithmgraph minorspanning tree congestion

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Network design and communication in computer systems (68M10)

Cited In (1)

• A graph theory approach for designing conservation reserve networks with minimal fragmentation

This page was built for publication: Designing low-congestion networks with structural graph theory

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