Title :
NC algorithms for recognizing chordal graphs and k trees
Author :
Chandrasekharan, N. ; Iyengar, S. Sitharama
Author_Institution :
Dept. of Math. Sci., Clemson Univ., SC, USA
fDate :
10/1/1988 12:00:00 AM
Abstract :
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(n4) processors. The algorithms have a better processor bound than an independent result by A. Edenbrandt (1985) for recognizing chordal graphs in parallel using O(n3m) processors
Keywords :
graph theory; parallel algorithms; trees (mathematics); NC algorithms; PRAM; chordal graph recognition; k trees; parallel algorithms; Computational modeling; Concurrent computing; Hardware; Parallel algorithms; Particle separators; Phase change random access memory; Polynomials; Terminology; Tree graphs; Writing;
Journal_Title :
Computers, IEEE Transactions on
