Efficient algorithms for shortest distance queries on special classes of polygons

Author： Sridhar R. Han K. Chandrasekharan N.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.140, Iss.2, 1995-04, pp. : 291-300

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient processing of graph similarity queries with edit distance constraints

By Zhao Xiang Xiao Chuan Lin Xuemin Wang Wei Ishikawa Yoshiharu

The VLDB Journal, Vol. 22, Iss. 6, 2013-12 ,pp. : 727-752

Springer Publishing Company

Access to resources Recommend Favorite

Optimization and evaluation of shortest path queries

By Chan Edward

The VLDB Journal, Vol. 16, Iss. 3, 2007-07 ,pp. : 343-369

Springer Publishing Company

Access to resources Recommend Favorite

Termination Detection for Parallel Shortest Path Algorithms

By Hribar M.R. Taylor V.E. Boyce D.E.

Journal of Parallel and Distributed Computing, Vol. 55, Iss. 2, 1998-12 ,pp. : 153-165

Academic Press

Access to resources Recommend Favorite

Improved shortest path algorithms for nearly acyclic graphs

By Saunders S. Takaoka T.

Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. : 535-556

Elsevier

Access to resources Recommend Favorite

Shortest path algorithms for nearly acyclic directed graphs

By Takaoka T.

Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. : 143-150

Elsevier

Access to resources Recommend Favorite