On the parameterized complexity of the edge monitoring problem (Q509893)
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: On the parameterized complexity of the edge monitoring problem |
scientific article; zbMATH DE number 6687383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of the edge monitoring problem |
scientific article; zbMATH DE number 6687383 |
Statements
On the parameterized complexity of the edge monitoring problem (English)
0 references
21 February 2017
0 references
Edge Monitoring
0 references
parameterized complexity
0 references
FPT algorithm
0 references
bidimensionality theory
0 references
graph algorithms
0 references
0 references
0.8702830672264099
0 references
0.7989534735679626
0 references
0.7562338709831238
0 references
