Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q2963899)
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: Parameterized complexity of the anchored k-core problem for directed graphs |
scientific article; zbMATH DE number 6687756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of the anchored \(k\)-core problem for directed graphs |
scientific article; zbMATH DE number 6687756 |
Statements
21 February 2017
0 references
parameterized complexity
0 references
directed graphs
0 references
anchored \(k\)-core
0 references
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs (English)
0 references
0.9805310964584352
0 references
0.764974057674408
0 references
0.7587498426437378
0 references
0.7367628216743469
0 references
0.7315154671669006
0 references
