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...

Full description

Bibliographic Details

Published in:	Parallel Processing Symposium, 7th International (IPPS '93 pp. 57 - 64
Main Authors:	Sha, E.H.-M., Steiglitz, K.
Format:	Conference Proceeding
Language:	English
Published:	IEEE Comput. Soc. Press 1993
Subjects:	Bipartite graph Computer science Distributed algorithms Fault tolerance Fault tolerant systems Runtime System recovery Very large scale integration
ISBN:	9780818634420, 0818634421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!