Abstract
We introduce the data structure of a rooted, alternating, labelled tree and show its utility for a combinatorial solution of the weighted stable set problem in bipartite graphs via linear programming. As a by-product we obtain a weighted max-min relation. We illustrate the algorithm on grid graphs and present compu- tational results that indicate the efficiency of our method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R. K., Magnanti, Th. L., Orlin, J. B. (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
Cunningham, W. H. (1976) A network simplex method. Math. Progr. 11, 105–116
Dantzig, G. B. (1951) Application of the simplex method to a transporta-tion problem. In: Koopmans, T. C. (Ed.): Activity Analysis of Production and Allocation. Wiley, New York, 359–373
Lemarchand, L. (2003) An implementation of the bipartite graph simplex method in C. Technical report, University of Brest
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Euler, R. (2004). A Bipartite Graph Simplex Method. In: Ahr, D., Fahrion, R., Oswald, M., Reinelt, G. (eds) Operations Research Proceedings 2003. Operations Research Proceedings, vol 2003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17022-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-17022-5_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21445-8
Online ISBN: 978-3-642-17022-5
eBook Packages: Springer Book Archive