Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:38, 8 February 2024
scientific article; zbMATH DE number 6442144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Dynamic Maximal Matching in $O(\log n)$ Update Time |
scientific article; zbMATH DE number 6442144 |
Statements
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (English)
0 references
2 June 2015
0 references
matching
0 references
dynamic graph algorithm
0 references
