Maximum matching width: new characterizations and a fast algorithm for dominating set (Q5363776)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6784971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum matching width: new characterizations and a fast algorithm for dominating set |
scientific article; zbMATH DE number 6784971 |
Statements
29 September 2017
0 references
FPT algorithms
0 references
treewidth
0 references
dominating set
0 references
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. (English)
0 references
0.9591479897499084
0 references
0.8111555576324463
0 references
0.7518637776374817
0 references
0.7417664527893066
0 references
0.7299326658248901
0 references
