On Approximating the d-Girth of a Graph (Q3075539): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-18381-2_39
+Normal rank
@@ Property / OpenAlex ID @@
+W1548537566
@@ Property / OpenAlex ID: W1548537566 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained subgraphs
@@ Property / cites work: Degree constrained subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-Constrained Subgraph Problems: Hardness and Approximation Results
+Normal rank
@@ Property / cites work @@
+Hardness and approximation of traffic grooming
@@ Property / cites work: Hardness and approximation of traffic grooming / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Induced Subgraphs of the Power of a Cycle
@@ Property / cites work: Induced Subgraphs of the Power of a Cycle / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with no subgraphs of minimal degree 3
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
+Normal rank
@@ Property / cites work @@
+The ring grooming problem
@@ Property / cites work: The ring grooming problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Subgraph Isomorphism Revisited
@@ Property / cites work: Planar Subgraph Isomorphism Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs of minimal degree \(k\)
@@ Property / cites work: Subgraphs of minimal degree \(k\) / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535037
@@ Property / cites work: Q4535037 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Directed Weighted-Degree Constrained Networks
+Normal rank
@@ Property / cites work @@
+On approximating the \(d\)-girth of a graph
@@ Property / cites work: On approximating the \(d\)-girth of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
+Normal rank
@@ Property / cites work @@
+A Census of Planar Triangulations
@@ Property / cites work: A Census of Planar Triangulations / rank @@
+Normal rank