Memory limits affect speed in changing graph models
Limited workspace requires polynomial update times for connectivity in a new dynamic model.
A new model for dynamic algorithms uses a bounded-space workspace. The algorithm has read-only oracle access to a changing input.
The study looks at dynamic undirected - connectivity. This means reporting if and are connected after every edge update to an -vertex graph.
The graph is accessed via adjacency list queries or adjacency matrix queries. An adjacency list query uses degree and the -th neighbor. An adjacency matrix query is a different way to access the graph.
With adjacency lists, incremental algorithms need worst-case time per insertion. With an adjacency matrix, time is necessary for incremental algorithms.
Fully dynamic algorithms need amortized time per update with adjacency lists. They need with an adjacency matrix, even on forests.
Polynomial update time is necessary whenever . This holds even for a single pair of vertices and even for incremental algorithms.
Key facts
- Incremental algorithms with adjacency lists need worst-case time per insertion.
- For adjacency matrices, time is necessary for incremental algorithms.
- Fully dynamic algorithms need amortized time per update with adjacency lists.
- Polynomial update time is necessary when .