A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 331-345

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

Maximum Series-Parallel Subgraph

By Călinescu Gruia Fernandes Cristina Kaul Hemanshu Zelikovsky Alexander

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 137-157

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time algorithm to compute a MAD tree of an interval graph

By Dahlhaus E. Dankelmann P. Ravi R.

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 255-259

Elsevier

Access to resources Recommend Favorite

An algorithm for shifted continued fraction expansions in parallel linear time

By Niederreiter H. Vielhaber M.

Theoretical Computer Science, Vol. 226, Iss. 1, 1999-09 ,pp. : 93-104

Elsevier

Access to resources Recommend Favorite

A Parallel Algorithm for Lagrange Interpolation on the Star Graph

By Sarbazi-Azad H. Ould-Khaoua M. Mackenzie L.M. Akl S.G.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 4, 2002-04 ,pp. : 605-621

Academic Press

Access to resources Recommend Favorite

Series-parallel languages and the bounded-width property

By Lodaya K. Weil P.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 347-380

Elsevier

Access to resources Recommend Favorite