On handling vertex deletion in updating minimum spanning trees
From MaRDI portal
Publication:1104108
DOI10.1016/0020-0190(88)90020-8zbMath0646.68083MaRDI QIDQ1104108
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90020-8
parallel computation; incremental algorithm; vertex deletion; parallel graph algorithm; updating of minimum spanning trees
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items