Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs

Authors:
Chin-Wen Ho;Richard, C. T. Lee
Affiliations:
National Tsing Hua Univ., Hsinchu, Republic of China;National Tsing Hua Univ., Hsinchu, Republic of China/ and Academia Sinica, Taipei, Republic of China
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 4

Graph Isomorphism and Identification Matrices: Parallel Algorithms

IEEE Transactions on Parallel and Distributed Systems
Fast parallel algorithms for the clique separator decomposition

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach

Information Sciences: an International Journal
Constructing perfect phylogenies and proper triangulations for three-state characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.89

Visualization

Abstract