Bibliographic Details
| Title: |
Optimal Decremental Connectivity in Planar Graphs. |
| Authors: |
Łącki, Jakub1 j.lacki@mimuw.edu.pl, Sankowski, Piotr2 sank@mimuw.edu.pl |
| Superior Title: |
Theory of Computing Systems. Nov2017, Vol. 61 Issue 4, p1037-1053. 17p. |
| Subject Terms: |
*COMPUTER algorithms, PLANAR graphs, PATHS & cycles in graph theory, GRAPH connectivity, MATHEMATICAL sequences |
| Abstract: |
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 a total of O( n) time. This results improves over a previously known O( n log n) time algorithm. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theory of Computing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Premier |