Shortest path algorithms for nearly acyclic directed graphs

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.203, Iss.1, 1998-08, pp. : 143-150

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

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

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

Interval Analysis on Directed Acyclic Graphs for Global Optimization

By Schichl Hermann Neumaier Arnold

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 541-562

Springer Publishing Company

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

Learning Bayesian Network Classifiers: Searching in a Space of Partially Directed Acyclic Graphs

By Acid Silvia

Machine Learning, Vol. 59, Iss. 3, 2005-06 ,pp. : 213-235

Springer Publishing Company

Access to resources Recommend Favorite