Constructing all shortest node-disjoint paths in torus networks

Cheng-Nan Lai. Constructing all shortest node-disjoint paths in torus networks. J. Parallel Distrib. Comput., 75:123-132, 2015. [doi]

@article{Lai15,
  title = {Constructing all shortest node-disjoint paths in torus networks},
  author = {Cheng-Nan Lai},
  year = {2015},
  doi = {10.1016/j.jpdc.2014.09.004},
  url = {http://dx.doi.org/10.1016/j.jpdc.2014.09.004},
  researchr = {https://researchr.org/publication/Lai15},
  cites = {0},
  citedby = {0},
  journal = {J. Parallel Distrib. Comput.},
  volume = {75},
  pages = {123-132},
}