Restrictions of graph partition problems. I (Q672380): Difference between revisions

@@ Property / Wikidata QID @@
+Q59567991
@@ Property / Wikidata QID: Q59567991 / rank @@
+Normal rank
@@ 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/0304-3975(95)00057-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2049181186
@@ Property / OpenAlex ID: W2049181186 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Processor optimization for flow graphs
@@ Property / cites work: Processor optimization for flow graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Interval-Ordered Tasks
@@ Property / cites work: Scheduling Interval-Ordered Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/tcs/BodlaenderJ95
@@ Property / DBLP publication ID: journals/tcs/BodlaenderJ95 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:672380