We show an algorithm for dynamic maintenance of connectivity information in an undirected planar graph subject to edge deletions. Our algorithm may answer connectivity queries of the form `Are vertices u and v connected with a path?' in constant time. The queries can be intermixed with any sequence of edge deletions, and the algorithm handles all updates in O(n) time. This results improves over previously known O(nlogn) time algorithm.
@article{arxiv.1409.7240,
title = {Optimal decremental connectivity in planar graphs},
author = {Jakub Łącki and Piotr Sankowski},
journal= {arXiv preprint arXiv:1409.7240},
year = {2014}
}