Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037)
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 6553690
| 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 6553690 |
Statements
Parameterized complexity of the anchored \(k\)-core problem for directed graphs (English)
0 references
10 March 2016
0 references
parameterized complexity
0 references
directed graphs
0 references
anchored \(k\)-core
0 references
0 references
0.9805310964584352
0 references
0.7480161190032959
0 references
0.7411952018737793
0 references
0.7312708497047424
0 references
0.7217127680778503
0 references
