Author:
Takahashi Junya,Suzuki Hitoshi,Nishizeki Takao
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference13 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. W. Dai, T. Asano, and E. S. Kuh, Routing region definition and ordering scheme for building-block layout,IEEE Trans. Computer-Aided Design,4(3) (1985), 189–197.
3. G. N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications,SIAM J. Comput.,16 (1987), 1004–1022.
4. H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union,J. Comput. System Sci.,30 (1985), 209–221.
5. J. JáJá,An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献