A combinatorial algorithm for weighted stable sets in bipartite graphs

Authors:
Ulrich Faigle;Gereon Frahling
Affiliations:
ZAIK, Center for Applied Computer Science, University of Cologne, Cologne, Germany;Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany
Venue:
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Year:
2006

Citing 1
Cited 4

An efficient implementation of a scaling minimum-cost flow algorithm

Journal of Algorithms

Communication: Level of repair analysis and minimum cost homomorphisms of graphs

Discrete Applied Mathematics
Solution of the Train Platforming Problem

Transportation Science
Level of repair analysis and minimum cost homomorphisms of graphs

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
d-Transversals of stable sets and vertex covers in weighted bipartite graphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing a maximum weighted stable set in a bipartite graph is considered well-solved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the case of dense graphs.