An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00206-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2052486876
@@ Property / OpenAlex ID: W2052486876 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Algorithm for Cograph Recognition with Applications
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
+Normal rank
@@ Property / cites work @@
+On Comparability and Permutation Graphs
@@ Property / cites work: On Comparability and Permutation Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1351615