NC algorithms for recognizing chordal graphs and k trees

Journal Article · Sat Oct 01 00:00:00 EDT 1988 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/12.5979· OSTI ID:6600081

Chandrasekharan, N ^[1]; Tyengar, S S ^[2]

---

1. Dept. of Mathematical Sciences, Clemson Univ., Clemson, SC (US)
2. Dept. of Computer Science, Louisiana State Univ., Baton Rouge, LA (US)

The authors present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n/sup 4/) processors. The authors' algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n/sup 3/m) processors. Furthermore, their characterizations for chordal graphs and kappa trees are interesting in their own right.

• OSTI ID: 6600081
• Journal Information: IEEE Trans. Comput.; (United States), Vol. 37:10
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
ARRAY PROCESSORS
COMPUTER CODES
GRAPHS
P CODES
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)