On the minimum clique partitioning problem on weighted chordal graphs (Q2272395): 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/j.tcs.2019.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2945393848
@@ Property / OpenAlex ID: W2945393848 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Some approximation algorithms for the clique partition problem in weighted interval graphs
+Normal rank
@@ Property / cites work @@
+On the partial order competition dimensions of chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3048611
@@ Property / cites work: Q3048611 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+On the clique partitioning problem in weighted interval graphs
+Normal rank
@@ Property / Wikidata QID @@
+Q127816690
@@ Property / Wikidata QID: Q127816690 / rank @@
+Normal rank