TY - GEN
T1 - Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees
AU - Peleg, David
PY - 1998
Y1 - 1998
N2 - This paper proposes a time-efficient distributed solution for the matroid basin complction problem. The; solution is based on a technique called climination upcasl, enabling us to reduce the amount of work necessary for the upcast by relying on the special properties of matroids. As an application, it is shown that the algorithm can be used for correcting a minimum weight spanning tree computed for a D-diameter network, after k edges have changed their weight, in time 0(k + D)).
AB - This paper proposes a time-efficient distributed solution for the matroid basin complction problem. The; solution is based on a technique called climination upcasl, enabling us to reduce the amount of work necessary for the upcast by relying on the special properties of matroids. As an application, it is shown that the algorithm can be used for correcting a minimum weight spanning tree computed for a D-diameter network, after k edges have changed their weight, in time 0(k + D)).
UR - http://www.scopus.com/inward/record.url?scp=84878608445&partnerID=8YFLogxK
U2 - 10.1007/bfb0055050
DO - 10.1007/bfb0055050
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84878608445
SN - 3540647813
SN - 9783540647812
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 164
EP - 175
BT - Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings
PB - Springer Verlag
T2 - 25th International Colloquium on Automata, Languages and Programming, ICALP 1998
Y2 - 13 July 1998 through 17 July 1998
ER -