Eidgenössische Technische Hochschule Zürich Swiss Federal Institute of Technology Zurich
暂无分享,去创建一个
[1] Peter Winkler,et al. Ring routing and wavelength translation , 1998, SODA '98.
[2] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[3] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[4] Amit Kumar,et al. Wavelength conversion in optical networks , 1999, SODA '99.
[5] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[6] Anthony S. Acampora,et al. Benefits of Wavelength Translation in All-Optical Clear-Channel Networks , 1996, IEEE J. Sel. Areas Commun..
[7] Luisa Gargano,et al. Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems , 2000 .
[8] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[9] Hans L. Bodlaender,et al. On Linear Time Minor Tests and Depth First Search , 1989, WADS.