1. Computers and Intractability a Guide to the Theory of NP-Completeness;Garey,1979
2. T.F. Gonzalez, F.D. Serena, Complexity of k-pairwise disjoint shortest paths in the hypercube and grid networks, Technical Report TRCS-2002-14, University of California at Santa Barbara, May 2002.
3. Complexity of pairwise shortest path routing in the grid;Gonzalez;Theoret. Comput. Sci.,2004
4. n-cube network: node disjoint shortest paths for maximal distance pairs of vertices;Gonzalez;Parallel Comput.,2004
5. T.F. Gonzalez, F.D. Serena, Pairwise disjoint shortest paths in the n-cube and related problems, Technical Report, CS Technical Report 2006-04, UCSB, 2006.