A self-stabilizing algorithm for the maximum flow problem

descriptionPublicationkeyboard_double_arrow_right Article 28 Jul 1997Publisher:Springer Science and Business Media LLCJournal:Distributed Computing, volume 10, pages 167-180 (issn: 0178-2770, eissn: 1432-0452,

Copyright policy )Funded by:NSF | Dynamic Distributed Syste...

Authors: Sukumar Ghosh; Arobinda Gupta; Sriram V. Pemmaraju;

doi: 10.1007/s004460050034 , 10.1109/pccc.1995.472519

A self-stabilizing algorithm for the maximum flow problem

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Iowa
United States

Keywords

distributed algorithms, Combinatorial optimization, self-stabilization, Graph theory (including graph drawing) in computer science, Distributed algorithms, Distributed systems, Reliability, testing and fault tolerance of networks and computer systems, fault-tolerance, maximum flow

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	21
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average