๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph

โœ Scribed by Yu. V. Voitishin

Publisher
Springer US
Year
1993
Tongue
English
Weight
274 KB
Volume
28
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An experimental comparison of solution a
An experimental comparison of solution algorithms for the single-machine tardiness problem
โœ Kenneth R. Baker; James B. Martin ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 778 KB

## Abstract A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A nu

Polynomial algorithms for the maximum st
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
โœ Raffaele Mosca ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

The Maximum Stable Set Problem (MS) is a well-known NP-hard problem. A popular research stream considers classes of graphs, defined in terms of forbidden subgraphs, in which either MS is NP-hard or can be solved by polynomial algorithms. In this paper we focus on three of these classes: in one of th

A Parallel Implementation of the Push-Re
A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem
โœ R. Anderson; J.C. Setubal ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for