Optimal parallel algorithms for path problems on planar graphs

Author： Srikrishna G.   Rangan C.P.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite

Optimal Parallel Algorithms for Computer Vision Problems

By Wu C-H.   Horng S-J.   Tsai H-R.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 6, 2002-06 ,pp. : 1021-1041

Academic Press

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

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