DFS is unsparsable and lookahead can help in maximal matching (Q4584659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: DFS is unsparsable and lookahead can help in maximal matching |
scientific article; zbMATH DE number 6931402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7806869745254517
0 references
0.7799610495567322
0 references
0.7777402400970459
0 references
0.770707368850708
0 references
