Parallel algorithms for the minimum cut and the minimum length tree layout problems

Author： Diaz J. Gibbons A. Pantziou G.E. Serna M.J. Spirakis P.G. Toran J.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.2, 1997-07, pp. : 267-287

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

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun Hsieh Yung En Lu Ping Jung

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 336-348

Inderscience Publishers

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D. Slutzki G.

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher Palocsay Susan

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Algorithms for VLSI Layout Verification

By MacPherson K. Banerjee P.

Journal of Parallel and Distributed Computing, Vol. 36, Iss. 2, 1996-08 ,pp. : 156-172

Academic Press

Access to resources Recommend Favorite

Wide-diameter and minimum length of fan

By Kojima T. Ando K.

Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. : 257-266

Elsevier

Access to resources Recommend Favorite