Single-Pass Streaming Algorithms to Partition Graphs into Few Forests

Cheng-Hung Chiang, Meng-Tsung Tsai

Abstract: We devise a single-pass O(n)-space deterministic streaming algorithm to partition any n-node undirected simple graph G into \(O(\alpha \log n)\) forests where \(\alpha \) is the minimum number of forests which G can be partitioned into. We then apply this result to obtain single-pass streaming algorithms for other graph problems, including low outdegree orientation, partitioning graphs into few planar subgraphs, and finding small dominating sets.