Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.28, Iss.1, 1998-07, pp. : 125-141

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

A Randomized Parallel Algorithm for Single-Source Shortest Paths

By Klein P.N. Subramanian S.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 205-220

Academic Press

Access to resources Recommend Favorite

Floats, Integers, and Single Source Shortest Paths

By Thorup M.

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 189-201

Academic Press

Access to resources Recommend Favorite

Growth of AlN films using hydrazidoalane single-source precursors

By Kim Y. Kim J.H. Park J.E. Bae B.J. Kim B. Park J.T. Yu K.-S. Kim Y.

Thin Solid Films, Vol. 339, Iss. 1, 1999-02 ,pp. : 200-202

Elsevier

Access to resources Recommend Favorite

A Neutral 1D Coordination Polymer Constructed from the NiII Complex of the N‐Phosphorylated Thiourea PhNHC(S)NHP(O)(OPh)2 and Pyrazine: A Single‐Source Precursor for Nickel Nanoparticles

EUROPEAN JOURNAL OF INORGANIC CHEMISTRY (ELECTRONIC), Vol. 2015, Iss. 7, 2015-03 ,pp. : 1160-1166

John Wiley & Sons Inc

Access to resources Recommend Favorite

Abstract convexity of extended real-valued ICR functions

By Daryaei M.H. Mohebi H.

Optimization, Vol. 62, Iss. 6, 2013-06 ,pp. : 835-855

Taylor & Francis Ltd

Access to resources Recommend Favorite