A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746)
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: A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
scientific article; zbMATH DE number 7205035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
scientific article; zbMATH DE number 7205035 |
Statements
27 May 2020
0 references
data structures
0 references
fixed-parameter tractability
0 references
unique label cover
0 references
linear-time FPT algorithms
0 references
0 references
A Linear-Time Parameterized Algorithm for Node Unique Label Cover (English)
0 references
0.86866605
0 references
0.86706823
0 references
0.85396457
0 references
0.85396457
0 references
0.8526326
0 references
0.8459353
0 references
0.8459353
0 references
0.8451086
0 references
0.8398794
0 references
