Showing papers by "Moni Naor published in 1987"
01 Jan 1987
TL;DR: An NC algorithm for recognizing chordal graphs, and NC algorithms for finding the following objects on chordal graph graphs: all maximal cliques, an intersection graph representation, an optimal coloring, a perfect elimination scheme, a maximum independent set, a minimum clique cover, and the chromatic polynomial are presented.
Abstract: We present an NC algorithm for recognizing chordal graphs, and we present NC algorithms for finding the following objects on chordal graphs: all maximal cliques, an intersection graph representation, an optimal coloring, a perfect elimination scheme, a maximum independent set, a minimum clique cover, and the chromatic polynomial The well known polynomial algorithms for these problems seem highly sequential, and therefore a different approach is needed to find parallel algorithms
39 citations
Proceedings Article•
01 Jan 1987
TL;DR: An 1VC algorithm for recognizing chordal graphs, and NC algorithms for finding the following objects on chorda.
Abstract: We present an 1VC algorithm for recognizing chordal graphs, a.nd we present NC algorithms for finding the following objects on chorda. graphs: all masimal cliques, aa intersection graph represent&ion, a.11 optimal coloring, a. perfect elimina.tion scheme, a. ma.simum independent set, a. minimum clique cover, and the chromatic polynomial. The well known polynomial algorithms for these problems seem highly sequential, and therefore a. different approach is needed to find parallel algorithms.
1 citations