The Community for Technology Leaders
Green Image
The authors present parallel algorithms for recognizing the chordal graphs and k trees. Under the PRAM (parallel random-access-machine) model of computation with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n/sup 4/) processors. The algorithms have a better processor bound than an independent result by A. Edenbrandt (1985) for recognizing chordal gra
chordal graph recognition; NC algorithms; k trees; parallel algorithms; PRAM; graph theory; parallel algorithms; trees (mathematics).

N. Chandrasekharan and S. Iyengar, "NC Algorithms for Recognizing Chordal Graphs and k Trees," in IEEE Transactions on Computers, vol. 37, no. , pp. 1178-1183, 1988.
81 ms
(Ver 3.3 (11022016))