Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices
暂无分享,去创建一个
[1] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.
[2] Ludek Kucera,et al. Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.
[3] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[4] Philip N. Klein,et al. Efficient parallel algorithms for chordal graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[5] Stavros D. Nikolopoulos,et al. Parallel Computation of Perfect Elimination Schemes Using Partition Techniques on Triangulated Graphs , 1995 .
[6] Moni Naor,et al. Fast parallel algorithms for chordal graphs , 1987, SIAM J. Comput..
[7] Richard C. T. Lee,et al. Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..
[8] Uzi Vishkin,et al. Implementation of Simultaneous Memory Address Access in Models That Forbid It , 1983, J. Algorithms.
[9] Anders Edenbrandt,et al. Chordal Graph Recognition is in NC , 1987, Inf. Process. Lett..
[10] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[11] Richard C. T. Lee,et al. Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..
[12] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[13] Faith Ellen,et al. Relations between concurrent-write models of parallel computation , 1984, PODC '84.
[14] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[15] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .