The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Parallel recognition algorithms for chordal_planar graphs and planar k-trees
Journal of Parallel and Distributed Computing
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
Information Processing Letters
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Linear-time counting algorithms for independent sets in chordal graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to our results is an efficient parallel algorithm for finding a perfect elimination ordering.