Single-pass streaming algorithms to partition graphs into few forests
From MaRDI portal
Publication:2695324
DOI10.1007/978-3-030-89543-3_45OpenAlexW3208490638MaRDI QIDQ2695324
Meng-Tsung Tsai, Cheng-Hung Chiang
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_45
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forests, frames, and games: Algorithms for matroid sums and applications
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- A data structure for dynamic trees
- The point-arboricity of a graph
- Tight Approximations of Degeneracy in Large Graphs
- Densest Subgraph in Dynamic Graph Streams
- Single Pass Spectral Sparsification in Dynamic Streams
- A Constructive Arboricity Approximation Scheme
- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
- The Probabilistic Communication Complexity of Set Intersection
- Sparsification—a technique for speeding up dynamic graph algorithms
- Testing Bounded Arboricity
- Sublinear Algorithms for (Δ + 1) Vertex Coloring
- Computing the Degeneracy of Large Graphs
- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Single-pass streaming algorithms to partition graphs into few forests
