Packing cycles exactly in polynomial time (Q421271): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-010-9347-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2057309492
@@ Property / OpenAlex ID: W2057309492 / rank @@
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization
@@ Property / cites work: Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in graphs
@@ Property / cites work: Packing cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in graphs. II
@@ Property / cites work: Packing cycles in graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859792
@@ Property / cites work: Q3859792 / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for cycle packing problems
+Normal rank
@@ Property / cites work @@
+-Matchings and 2-covers of hypergraphs
@@ Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+Disjoint Cycles: Integrality Gap, Hardness, and Approximation
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank