A network flow approach for hierarchical tree partitioning
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[2] Gopalakrishnan Vijayan,et al. Generalization of Min-Cut Partitioning to Tree Structures and Its Applications , 1991, IEEE Trans. Computers.
[3] R. Prim. Shortest connection networks and some generalizations , 1957 .
[4] David J. Goodman,et al. Personal Communications , 1994, Mobile Communications.
[5] Satish Rao,et al. Finding near-optimal cuts: an empirical evaluation , 1993, SODA '93.
[6] Joseph Naor,et al. Fast approximate graph partitioning algorithms , 1997, SODA '97.
[7] M. Iri. ON AN EXTENSION OF THE MAXIMUM-FLOW MINIMUM-CUT THEOREM TO MULTICOMMO))ITY FLOWS , 1971 .
[8] Chingwei Yeh,et al. Circuit clustering using a stochastic flow injection method , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[10] David R. Karger,et al. Minimum cuts in near-linear time , 1996, STOC '96.
[11] Chung-Kuan Cheng,et al. Network partitioning into tree hierarchies , 1996, DAC '96.
[12] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[13] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.