Partitioning graphs into Hamiltonian ones

Parallel Computing

Volumn 22, Issue 4, 1996, Pages 607-618

  Chen, Lin ^a  

^a Fundamental Research Laboratory   (United States)

Author keywords

Bipartite permutation graphs; Graph partition; Hamiltonian graphs; Parallel algorithms; Time and processor requirements

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; LINEARIZATION; OPTIMIZATION; POLYNOMIALS;

BIPARTITE PERMUTATION GRAPH; HAMILTONIAN SUBGRAPHS; LINEAR TIME ALGORITHM; PARTITIONING GRAPHS; TIME AND PROCESSOR REQUIREMENTS;

PARALLEL ALGORITHMS;

EID: 0030165054     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(95)00007-0     Document Type: Article

References (21)

1. F. Abolhassan, R. Drefenstedt, J. Keller, W.J. Paul and D. Scheerer, On the physical design of PRAMs, Computer J., 36(8) (Dec. 1993) 756-762.
2. S.B. Akers, D. Harel and B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proc. Int. Conf. on Parallel Processing (1987) 393-400.
3. S.G. Akl and G.R. Guenther, Broadcasting with selective reduction, in: G.X. Ritter, editor, Proc. 11th IFIP World Computer Congress (North-Holland, 1989) 515-520.
4. L. Chen, Solving the shortest-paths problem on bipartite permutation graphs efficiently, Information Processing Letters 55(5) (Sep. 1995) 259-264.
5. L. Chen and Z. Hu, Algorithms for three practical optimization problems, Computer Research & Development (6) (1990) 33-39.
6. L. Chen and Y. Yesha, Parallel recognition of the consecutive ones property with applications, J. Algorithms 12(3) (Sep. 1991) 375-392.
7. L. Chen and Y. Yesha, Efficient parallel algorithms for bipartite permutation graphs, Networks 23(1) (Jan. 1993) 29-39.
8. R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Information and Computation 81(3) (June 1989) 334-352.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979).
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Computer Science and Applied Mathematics (Academic Press, New York, 1980).
11. X. He and Y. Yesha, Parallel recognition and decomposition of two terminal series parallel graphs, Information and Computation 75 (1987) 15-38.
12. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. on Computing 2 (1973) 225-231.
13. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability (McGraw-Hill, 1993).
14. R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in: J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A (North Holland, Amsterdam, 1990) 869-941.
15. R.M. Karp, E. Upfal and A. Wigderson, Constructing a perfect matching is in random NC, Combinatorica 6(1) (1986) 35-48.
16. G.F. Lev, N. Pippenger and L.G. Valiant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. Computers C-30(2) (Feb. 1981) 93-100.
17. L.F. Lindon and S.G. Akl, An optimal implementation of broadcasting with selective reduction, IEEE Trans. Parallel and Distributed Systems 4(3) (March 1993) 256-269.
18. S. Micali and V.V. Vazirani; An O(√| V | · | E \) algorithm for finding maximal matching in general graphs, in: Proc. 21st Ann. Symp. on Foundations of Computer Science (IEEE Computer Society, 1980) 17-27.
19. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
20. A. Pnueli, A. Lempel and S. Even, Transitive orientation of graphs and identification of permutation graphs, Canad, J. Math. 23 (1971) 160-175.
21. J. Spinrad, A. Brandstädt and L. Stewart, Bipartite permutation graphs, Discrete Applied Math. 18 (1987) 279-292.