R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks

Author： D'Alberto Paolo   Nicolau Alexandru  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.2, 2007-02, pp. : 203-213

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

Related content

A Divide-and-Conquer Learning Approach to Radial Basis Function Networks

By CHEUNG YIU-MING   HUANG RONG-BO  

Neural Processing Letters, Vol. 21, Iss. 3, 2005-06 ,pp. : 189-206

Springer Publishing Company

Access to resources Recommend Favorite

Divide-and-conquer algorithms on the hypercube

By Mayr E.W.   Werchner R.  

Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. : 283-296

Elsevier

Access to resources Recommend Favorite

A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers: Parallel and Distributed Processing with Applications (Guest Editor: Minyi Guo)

By Wang Hui   Guo Minyi   Wei Daming  

The Journal of Supercomputing, Vol. 29, Iss. 2, 2004-08 ,pp. : 157-170

Springer Publishing Company

Access to resources Recommend Favorite

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

By Okumoto Kazumasa   Fukunaga Takuro   Nagamochi Hiroshi  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 787-806

Springer Publishing Company

Access to resources Recommend Favorite

Solving the Double Transposition Challenge with a Divide-and-Conquer Approach

By Lasry George   Kopal Nils   Wacker Arno  

Cryptologia, Vol. 38, Iss. 3, 2014-07 ,pp. : 197-214

Taylor & Francis Ltd

Access to resources Recommend Favorite