Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
Pages 83 - 107
Abstract
This paper presents BSR-parallel algorithms for some problems in fundamental graph theory : transitive closure, connected components, spanning tree, bridges and articulation points of a graph and bipartite graph recognition. There already exist constant time algorithms to solve these problems on a mesh with reconfigurable bus system using O ( N 4 ) processors. Here we show that these problems can be solved in constant time using only O ( N 2 ) processors on the BSR model ( N is the number of vertices of the graph G ). Therefore, our algorithms are more work-efficient. These new results suggest that many other problems in graph theory can be solved in constant time using the BSR model.
References
[1]
1. Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading, MA.
[2]
2. Akl SG (1997) Parallel computation: Models and methods, Prentice Hall, Upper Saddle River, NJ.
[3]
3. Akl SG, Guenther GR (1989) Broadcasting with selective reduction. In: Information Processing 89 , Ritter GX (ed) Proceedings of the IFIP 11th world computer congress. North-Holland, San Francisco, pp 515-520.
[4]
4. Akl SG, Stojmenovic I (1994) Multiple criteria BSR: An implementation and applications to computational geometry problems. In: Proceedings of the twenty-seventh annual hawaii international conference on system sciences.
[5]
5. Akl SG, Stojmenovic I (1996) Broadcasting with selective reduction: A powerful model of parallel computation. In: AY Zomaya (ed) Parallel and distributed computing handbook. McGraw-Hill, New York, pp 192-222.
[6]
6. Arlazarov VL, Dinic EA, Kronrod MA, Faradzev IA (1970) On economical construction of the transitive closure of a directed graph. Soviet Math Dokl 11 :1209-1210.
[7]
7. Atallah MJ, Kosaraju SR (1984) Graph problems on a mesh-connected processor array. J Assoc Comput Mach 31(3):649-667.
[8]
8. Auslander L, Parter SV (1961) On embedding graphs in the plane. J Math Mech 10:517-523.
[9]
9. Berge C (1962) The theory of graphs and its applications. John Wiley and Sons, New York.
[10]
10. Bollobás B (1979) Graph Theory: An introductory course. Springer Verlag, New York.
[11]
11. Bondy JA, Murty USR (1976) Graph theory with applications. Elsevier North-Holland, New York.
[12]
12. Delacourt E, Myoupo JF, Semé D (1999) A constant time parallel detection of repetition. Parall Proc Lett 9(1):81-92.
[13]
13. Fava Lindon L, Akl SG (1993) An optimal implantation of broadcasting with selective reduction. IEEE Trans Paral Distr Syst 4(3):256-269.
[14]
14. Guibas LJ, Kung HT, Thompson CD (1979) Direct VLSI implementation of combinatorial algorithm. In: Proc. Caltech Conference on VLSI, pp 509-525.
[15]
15. Huang TS, Tsai MS (1989) A linear systolic algorithm for the connected component problem. BIT 29:217- 226.
[16]
16. Kung SY, Lo SC, Lewis PS (1987) Optimal systolic design for the transitive closure and shortest path problems. IEEE Trans Comput C36(5):603-614.
[17]
17. Manber U (1989) Introduction to algorithms: A creative approach. Addison-Wesley.
[18]
18. Myoupo JF, Semé D (1997) A parallel solution of the sequence alignment problem using BSR model. In: Proc. of the 10th international conference of parallel and distributed computing systems. pp 357-362.
[19]
19. Myoupo JF, Semé D (1999) Time-efficient parallel algorithms for the longest common subsequence and related problems. J Parall Distri Comput 57:212-223.
[20]
20. Myoupo JF, Semé D (2000) Efficient parallel algorithms for the LIS and LCS problems on BSR model using constant number of selections. Parall Alg Appl 14:187-202.
[21]
21. Myoupo JF, Semé D (2002) Optimal BSR solutions to several convex polygon problems. J Supercomput 21(I):77-90.
[22]
22. Ramakrishnan IV, Varman PJ (1984) Dynamic programming and transitive closure on linear pipelines. In: Proc ICPP.
[23]
23. Semé D (1999) An efficient algorithm on the BSR-based parallel architecture for the k -LCS problem. In: Proc Int Conf Parall Distr Proc Techn Appl (to appear 1999).
[24]
24. Stojmenovic I (1996) Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstitution from its traversals. IEEE Trans Parall Distr Syst 7(2):218-224.
[25]
25. Wang BF, Chen GH (1990) Constant time algorithms fbr the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems. IEEE Trans Parall Distr Syst 1(4):500-507.
Index Terms
- Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory
Recommendations
Optimal BSR Solutions to Several Convex Polygon Problems
This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time solutions on a linear number, max(N, M) (where N and M are the number of edges of the two ...
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer ScienceThe first efficient parallel algorithm for computing minimal elimination ordering (MEO) of an arbitrary graph is designed. The algorithm works in O(log/sup 3/n) parallel time and O(nm) processors on a concurrent-read-concurrent-write parallel random-...
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
We present efficient algorithms for solving several fundamental graph-theoretic problems on a Linear Array with a Reconfigurable Pipelined Bus System (LARPBS), one of the recently proposed models of computation based on optical buses. Our algorithms ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 2006 Springer Science + Business Media, LLC.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 October 2006
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in