Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time (Q2978516)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time |
scientific article |
Statements
25 April 2017
0 references
graph algorithm
0 references
dynamic graph
0 references
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time (English)
0 references
