Login / Signup

Disjoint path covers with path length constraints in restricted hypercube-like graphs.

Jung-Heum ParkHee-Chul KimHyeong-Seok Lim
Published in: J. Comput. Syst. Sci. (2017)
Keyphrases
  • path length
  • small world
  • shortest path
  • scale free
  • graph matching
  • weighted graph
  • graph theoretic
  • clustering coefficient
  • directed graph
  • reverse engineering
  • graph mining