On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867): Difference between revisions

@@ Property / cites work @@
+Q2861508
@@ Property / cites work: Q2861508 / rank @@
+Normal rank
@@ Property / cites work @@
+The General Pickup and Delivery Problem
@@ Property / cites work: The General Pickup and Delivery Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Eulerian path approach to DNA fragment assembly
+Normal rank
@@ Property / cites work @@
+Minimal Eulerian Circuit in a Labeled Digraph
@@ Property / cites work: Minimal Eulerian Circuit in a Labeled Digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for DNA sequence assembly
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank