Optimal MST maintenance for transient deletion of every node in planar graphs

  • Authors:

  • Carlo Gaibisso;Guido Proietti;Richard B. Tan

  • Affiliations:

  • Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti", CNR, Roma, Italy;Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti", CNR, Roma, Italy and Dipartimento di Informatica, Università di L'Aquila, L'Aquila, Italy;Department of Computer Science, Utrecht University, Utrecht, The Netherlands, and Department of Computer Science, University of Sciences & Arts of Oklahoma, Chickasha, OK

  • Venue:
  • COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a minimum spanning tree of a 2-node connected, real weighted, planar graph G = (V, E) with n nodes, we study the problem of finding, for every node v ∈ V, a minimum spanning tree of the graph G - v (the graph G deprived of v and all its incident edges). We show that this problem can be solved on a pointer machine in optimal linear time, thus improving the previous known O(n ċ α(n, n)) time bound holding for general sparse graphs, where α is the functional inverse of Ackermann's function. In this way, we obtain the same runtime as for the edge removal version of the problem, thus filling the previously existing gap. Our algorithm finds application in maintaining wireless networks undergoing transient station failures.