Coarse Grained Parallel Graph Planarity Testing
暂无分享,去创建一个
[1] Vijaya Ramachandran,et al. An optimal parallel algorithm for graph planarity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Afonso Ferreira,et al. Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP , 1997, ICALP.
[3] Takao Nishizeki,et al. Planar Graphs: Theory and Algorithms , 1988 .
[4] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[5] Uzi Vishkin,et al. Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs , 1986, Theor. Comput. Sci..
[6] Joseph JáJá,et al. Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..
[7] Albert Chan,et al. Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs , 2000, WG.
[8] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[9] Albert Chan,et al. A Note on Coarse Grained Parallel Integer Sorting , 1999, Parallel Process. Lett..
[10] Philip N. Klein,et al. An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).