A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169608804486
+Normal rank
@@ Property / OpenAlex ID @@
+W2111523610
@@ Property / OpenAlex ID: W2111523610 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the shortest path problem
@@ Property / cites work: Faster algorithms for the shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the single step graph searching problem by solving the maximum two-independent set problem
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
+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 @@
+An Optimal Algorithm for the Maximum Two-Chain Problem
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2710758