Maintaining bipartite matchings in the presence of failures

The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of t...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel Processing Symposium, 7th International (IPPS '93 s. 57 - 64
Hlavní autori:	Sha, E.H.-M., Steiglitz, K.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE Comput. Soc. Press 1993
Predmet:	Bipartite graph Computer science Distributed algorithms Fault tolerance Fault tolerant systems Runtime System recovery Very large scale integration
ISBN:	9780818634420, 0818634421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!