We present an algorithm that supports operations for modifying a split graph by adding edges or vertices and deleting edges, such that after eachmodification the graph is repaired to become a split graph in a minimal way. In particular, if the graph is not split after the modification, the algorithm computes a minimal, or if desired even a minimum, split completion or deletion of themodified gr...
