Shipper collaboration (Q858256): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2005.07.026
@@ Property / DOI: 10.1016/j.cor.2005.07.026 / rank @@
-Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part I: The Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+On the Complexity of Finding a Minimum Cycle Cover of a Graph
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Simple Circuits
@@ Property / cites work: Covering Graphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest coverings of graphs with cycles
@@ Property / cites work: Shortest coverings of graphs with cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Multigraphs by Simple Circuits
@@ Property / cites work: Covering Multigraphs by Simple Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle covering in bridgeless graphs
@@ Property / cites work: Cycle covering in bridgeless graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Cycles
@@ Property / cites work: Covering Graphs by Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a graph with cycles.
@@ Property / cites work: Covering a graph with cycles. / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2005.07.026
@@ Property / DOI: 10.1016/J.COR.2005.07.026 / rank @@
+Normal rank