Some parallel algorithms on interval graphs

Alan A Bertossi, Maurizio A Bonuccelli
1987 Discrete Applied Mathematics  
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent set, a minimum clique cover, and a minimum weighted dominating set of an interval graph. Parallel algorithms are also given for finding a Hamiltonian circuit and the minimum bandwidth of a proper interval graph. The shared memory model (SMM) of parallel computers is used to obtain fast algorithms.
doi:10.1016/0166-218x(87)90068-0 fatcat:fp74fnm5jbh5bhzhyc52y2vnfa