Login / Signup

Efficient Approximations for Thinnest Path Problem in Grid Graph.

Shuang WuZhiyin ChenYang WangXiaofeng GaoFan WuGuihai Chen
Published in: IMCOM (2018)
Keyphrases
  • cost effective
  • graph theory
  • random walk
  • shortest path
  • graph theoretic
  • database
  • data structure
  • computationally efficient
  • structured data
  • graph structure
  • graph partitioning
  • solution path