The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971)
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: The snow team problem (clearing directed subgraphs by mobile agents) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The snow team problem (clearing directed subgraphs by mobile agents) |
scientific article |
Statements
The snow team problem (clearing directed subgraphs by mobile agents) (English)
0 references
22 November 2017
0 references
graph searching
0 references
FPT-algorithm
0 references
NP-hardness
0 references
monomial
0 references
0.86943686
0 references
0.80726624
0 references
0.8044586
0 references
0.7958999
0 references
0.79523313
0 references
0.79384714
0 references
0.79233444
0 references
0.7921833
0 references
