Improved shortest path algorithms for nearly acyclic graphs

Author： Saunders S.   Takaoka T.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

Efficient algorithms for acyclic colorings of graphs

By Chen Z.-Z.  

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 75-95

Elsevier

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

Optimal parallel algorithms for path problems on planar graphs

By Srikrishna G.   Rangan C.P.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 27-43

Elsevier

Access to resources Recommend Favorite

Improved calculation method of shortest path with cellular automata model

By Wang Min   Qian Yongsheng   Guang Xiaoping  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 41, Iss. 3-4, 2012-04 ,pp. : 508-517

Emerald Group Publishing Ltd

Access to resources Recommend Favorite