REOPTIMIZATION UNDER VERTEX INSERTION: MAX P<sub>k</sub>-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH (Q2846477): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimizing the traveling salesman problem
@@ Property / cites work: Reoptimizing the traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimizing the 0-1 knapsack problem
@@ Property / cites work: Reoptimizing the 0-1 knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+Reoptimization of Steiner trees: changing the terminal set
+Normal rank
@@ Property / cites work @@
+Reoptimization of the metric deadline TSP
@@ Property / cites work: Reoptimization of the metric deadline TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Fast reoptimization for the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+Q4340879
@@ Property / cites work: Q4340879 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with forbidden sets
@@ Property / cites work: Scheduling with forbidden sets / rank @@
+Normal rank
@@ Property / cites work @@
+On finite affine line transitive planes
@@ Property / cites work: On finite affine line transitive planes / rank @@
+Normal rank
@@ Property / cites work @@
+New Reoptimization Techniques applied to Steiner Tree Problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830913600045
+Normal rank
@@ Property / OpenAlex ID @@
+W1984149217
@@ Property / OpenAlex ID: W1984149217 / rank @@
+Normal rank