DFS is Unsparsable and Lookahead Can Help in Maximal Matching (Q4584659)
From MaRDI portal
scientific article; zbMATH DE number 6931402
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DFS is Unsparsable and Lookahead Can Help in Maximal Matching |
scientific article; zbMATH DE number 6931402 |
Statements
DFS is Unsparsable and Lookahead Can Help in Maximal Matching (English)
0 references
3 September 2018
0 references
dynamic graphs
0 references
depth-first search
0 references
sparse strong certificate
0 references
maximal matching
0 references
lookahead
0 references
