Login / Signup

Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids.

Jung-Heum Park
Published in: J. Comput. Sci. Eng. (2018)
Keyphrases
  • shortest path
  • newly developed
  • bipartite graph
  • graph model
  • pairwise
  • grid computing
  • information retrieval
  • real valued
  • multiscale
  • search algorithm
  • irregular isothetic grids