arXiv (All)open access
Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space
data structures and algorithms
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1013339
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.