Fast parallel algorithms for chordal graphs

Authors:
Joseph (Seffi) Naor;Moni Naor;Alejandro A. Schäffer
Affiliations:
Hebrew Univ., Jerusalem, Israel;Univ. of California at Berkeley, Berkeley;Stanford Univ., Stanford, CA
Venue:
SIAM Journal on Computing
Year:
1989

Citing 0
Cited 5

Fully dynamic algorithms for chordal graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Improved Distance Oracles for Avoiding Link-Failure

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Parallel recognition algorithms for chordal_planar graphs and planar k-trees

Journal of Parallel and Distributed Computing
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract