Parallel Algorithms for Reducible Flow Graphs

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.23, Iss.1, 1997-04, pp. : 1-31

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 Characterization of Domination Reducible Graphs

By Zverovich Igor Ed.

Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. : 281-289

Springer Publishing Company

Access to resources Recommend Favorite

Bi-complement Reducible Graphs

By Giakoumakis V. vanherpe J.M.

Advances in Applied Mathematics, Vol. 18, Iss. 4, 1997-05 ,pp. : 389-402

Academic Press

Access to resources Recommend Favorite

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

By Hota Mrinmoy Pal Madhumangal Pal Tapan K.

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE A STEINER TREE ON PERMUTATION GRAPHS

By MONDAL S. PAL M. PAL T.

International Journal of Computer Mathematics, Vol. 80, Iss. 8, 2003-08 ,pp. : 937-943

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Parallel Algorithms for the Minimum Cost Flow Problem

By Beraldi P. Guerriero F. Musmanno R.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 501-530

Springer Publishing Company

Access to resources Recommend Favorite