An On-Line Edge-Deletion Problem
From MaRDI portal
Publication:3902517
DOI10.1145/322234.322235zbMath0454.68075WikidataQ55891645 ScholiaQ55891645MaRDI QIDQ3902517
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322234.322235
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
A special case the of dynamization problem for least cost paths, On-line computation of minimal and maximal length paths, Maintaining bridge-connected and biconnected components on-line, On the computational complexity of dynamic graph problems, Decremental 2- and 3-connectivity on planar graphs