The path partition problem and related problems in bipartite graphs (Q2465958): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2006.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2074198833
@@ Property / OpenAlex ID: W2074198833 / rank @@
+Normal rank
@@ Property / cites work @@
+On Local Search for Weighted <i>k</i>-Set Packing
@@ Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Q4828917
@@ Property / cites work: Q4828917 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4093489
@@ Property / cites work: Q4093489 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum packing of 3-edge paths
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum triangle packing
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path partition of graphs.
@@ Property / cites work: On the \(k\)-path partition of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
+Normal rank
@@ Property / cites work @@
+Path factors of bipartite graphs
@@ Property / cites work: Path factors of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-path partitions in trees
@@ Property / cites work: \(k\)-path partitions in trees / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2465958