A polynomial-time algorithm for outerplanar diameter improvement (Q2402366): Difference between revisions

@@ Property / arXiv ID @@
+.5702
@@ Property / arXiv ID: 1403.5702 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Disjoint-Paths Completion
@@ Property / cites work: Planar Disjoint-Paths Completion / rank @@
+Normal rank
@@ Property / cites work @@
+Decreasing the diameter of bounded degree graphs
@@ Property / cites work: Decreasing the diameter of bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a forest
@@ Property / cites work: Quickly excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximability and non-approximability results for graph diameter decreasing problems
+Normal rank
@@ Property / cites work @@
+Mixed covering of trees and the augmentation problem with odd diameter constraints
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q2876021
@@ Property / cites work: Q2876021 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Design networks with bounded pairwise distance
@@ Property / cites work: Design networks with bounded pairwise distance / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of DNA physical mapping
@@ Property / cites work: On the complexity of DNA physical mapping / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on the planar branchwidth with respect to the largest grid minor size
+Normal rank
@@ Property / cites work @@
+Q3549635
@@ Property / cites work: Q3549635 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs to Meet Diameter Requirements
+Normal rank
@@ Property / cites work @@
+-connecting outerplanar graphs without blowing up the pathwidth
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs
@@ Property / cites work: Augmenting Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / 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 @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank