“…Indeed, a one-to-one 1-disjoint path cover of a network is just a Hamiltonian path between any two nodes. A large amount of work on Hamiltonian path embeddings in various networks appeared in the literature [1][2][3][4][5]. On the other hand, for an embedding of disjoint paths in a network, a cover implies that every node can participate in a pipeline computation.…”