Login / Signup

Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.

Carlo GaibissoGuido ProiettiRichard B. Tan
Published in: COCOON (2003)
Keyphrases
  • planar graphs
  • directed graph
  • undirected graph
  • objective function
  • linear programming
  • closed form
  • optimal solution
  • xml documents
  • special case
  • worst case
  • level set
  • tree structure
  • minimum weight