An NC algorithm for the clique cover problem in cocomparability graphs and its application

DOI10.1016/0020-0190(95)00206-5zbMath0875.68467OpenAlexW2052486876MaRDI QIDQ1351615

Chongkye Rhee, Y. Daniel Liang

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00206-5

zbMATH Keywords

Depth-first searchPermutation graphsCocomparability graphsMinimum clique cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

Induced matchings in intersection graphs.

Cites Work

• Unnamed Item
• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Parallel Algorithm for Cograph Recognition with Applications
• On Comparability and Permutation Graphs
• Paths, Trees, and Flowers

This page was built for publication: An NC algorithm for the clique cover problem in cocomparability graphs and its application