Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 487-498

  Dahlhaus, Elias ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms and data structures; Parallel algorithms

Indexed keywords

DATA STRUCTURES; FORESTRY;

ALGORITHMS AND DATA STRUCTURES; BREADTH-FIRST-SEARCH TREES; COMPACT REPRESENTATION; DEPTH FIRST SEARCH; MAXIMUM CLIQUE; PERFECT ELIMINATION ORDER; POLYLOGARITHMIC TIME; STRONGLY CHORDAL GRAPH;

PARALLEL ALGORITHMS;

EID: 84867998496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023483     Document Type: Conference Paper

References (19)

1. K. Abrahamson, N. Dadoun, D. Kirkpatrick, T. Przyticka, A Simple Parallel Tree Contraction Algorithm, Journal of Algorithms 10 (1989), pp. 287-302.
2. M. Atallah, M. Goodrich, S.R. Kosaraju, Parallel Algorithms for Evaluating Sequences of Set Manipulation Operations, Journal of the ACM 41 (1994), pp. 1049-1085.
3. P. Bunemann, A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9 (1974), pp. 205-212.
4. E. Dahlhaus, Fast parallel algorithm for the single link heuristics of hierarchical clustering, Proceedings of the fourth IEEE Symposium on Parallel and Distributed Processing (1992), pp. 184-186.
5. E. Dahlhaus, P. Damaschke, The Complexity of Domination Problems in Chordal and Strongly Chordal Graphs, Discrete Applied Mathematics 52 (1994), pp. 261-273.
6. E. Dahlhaus, A fast parallel algorithm to compute Steiner-trees in strongly chordal graphs, Discrete Applied Mathematics 51 (1994), pp. 47-61.
7. E. Dahlhaus, Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation, Proceedings of the 27-th Annual Hawaii International Conference on System Sciences, Vol. II (1994), pp. 150-158.
8. R. Fagin, Degrees of Acyclicity and Relational Database Schemes, Journal of the ACM 30 (1983), pp. 514-550.
9. M. Farber, Characterizations of Strongly Chordal Graphs, Discrete Mathematics 43 (1983), pp. 173-189.
10. M. Farber, Domination, Independent Domination and Duality in Strongly Chordal Graphs, Discrete Applied Mathematics 7(1984), pp. 115-130.
11. H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci., 30 (1984), pp. 209-221.
12. F. Gavril, The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs, Journal of Cobinatorial Theory Series B, vol. 16(1974), pp. 47-56.
13. J. Gilbert, H. Hafsteinsson, Parallel Solution of Sparse Linear Systems, SWAT 88 (1988), LNCS 318, pp. 145-153.
14. P. Klein, Efficient Parallel Algorithms for Chordal Graphs, 29. IEEE-FOCS (1988), pp. 150-161.
15. D. Rose, Triangulated Graphs and the Elimination Process, Journal of Mathematical Analysis and Applications 32 (1970), pp. 597-609.
16. Y. Shiloach, U. Vishkin, An O(log n) Parallel Connectivity Algorithm, Journal of Algorithms 3 (1982), pp. 57-67.
17. J. Spinrad, Nonredundant 1's in Γ-free Matrices, SIAM Journal on Discrete Mathematics 8 (1995), pp. 251-257.
18. R. Tarjan, M. Yannakakis, Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing 13 (1984), pp. 566-579. Addendum: SIAM Journal on Computing 14 (1985), pp. 254-255.
19. K. White, M. Farber, W. Pulleyblank, Steiner Trees, Connected Domination, and Strongly Chordal Graphs, Networks 15 (1985), pp. 109-124.