Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
GSIS SELECTED LECTURES: Exploring Collaborative Mathematics
Designing Low-Congestion Networks with Structural Graph Theory
Yota OTACHI
Author information
Keywords: Graph algorithm, spanning tree congestion, Graph minor
JOURNAL FREE ACCESS

2011 Volume 17 Issue 3 Pages 197-216

Details
Download PDF (472K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
In these lecture notes, we study problems of designing low-congestion subnetworks of given networks. We apply some newest results in Graph Minor Theory to the problem, and obtain efficient (even best possible) algorithms.
Content from these authors
© 2011 by the Graduate School of Information Sciences (GSIS), Tohoku University

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/
Previous article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top