Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588)
From MaRDI portal
scientific article; zbMATH DE number 6869954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) |
scientific article; zbMATH DE number 6869954 |
Statements
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (English)
0 references
18 May 2018
0 references
matching
0 references
dynamic graph algorithm
0 references
0 references
