An approach to parallel algorithm design

G. Georgakopoulos; A. Stafylopatis

Displaying similar documents to “An approach to parallel algorithm design”

The disjoint cliques problem

Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Analysis of a class of graph partitioning problems

P. Bertolazzi, M. Lucertini, A. Marchetti Spaccamela (1982)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Minimum convex-cost tension problems on series-parallel graphs

Bruno Bachelet, Philippe Mahey (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in $O (m^{3})$ operations.