出版社：The Editorial Committee of the Interdisciplinary Information Sciences
摘要：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.
关键词：Graph algorithm;spanning tree congestion;Graph minor
