1 A, "Optimal parallel algorithms for finding cut vertices andbridges of interval graphs bridges of interval graphs" 229 229-234 234, 19921992
2 Das, "Efficient parallel algorithms on interval graphs" 131 154-605 141,
3 Liang, "Efficient parallel algorithms for findingbiconnected components of some intersection graphs" 48-52, 1991
4 Kao, "Animproved parallel algorithm for k-vertex connectivity" 157-174, 1993
5 D. Bera, "An efficient algorithm to generate all maximal cliques ontrapezoid graphs" 79 (79): 1057-1065, 2002