Graduate School of Information Sciences, Tohoku University
2011 年 17 巻 3 号 p. 197-216
(EndNote、Reference Manager、ProCite、RefWorksとの互換性あり)
(BibDesk、LaTeXとの互換性あり)
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.
すでにアカウントをお持ちの場合 サインインはこちら