Login / Signup

Deleting Vertices to Bound Path Length.

Doowon PaikSudhakar M. ReddySartaj Sahni
Published in: IEEE Trans. Computers (1994)
Keyphrases
  • path length
  • shortest path
  • small world
  • upper bound
  • weighted graph
  • lower bound
  • clustering coefficient
  • worst case
  • total weight
  • data model
  • binary images
  • social interaction
  • undirected graph