New algorithms for max restricted path consistency

ISSN： 1383-7133

Source： Constraints, Vol.16, Iss.4, 2011-10, pp. : 372-406

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

Trust region dogleg path algorithms for unconstrained minimization

By Zhang J. Xu C.

Annals of Operations Research, Vol. 87, Iss. 1, 1999-01 ,pp. : 407-418

Springer Publishing Company

Access to resources Recommend Favorite

Fast RNC and NC algorithms for maximal path sets

By Uehara R. Chen Z.-Z. He X.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 89-98

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

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

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