Best and worst case permutations for random online domination of the path (Q4561222)
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: Best and worst case permutations for random online domination of the path |
scientific article; zbMATH DE number 6991589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best and worst case permutations for random online domination of the path |
scientific article; zbMATH DE number 6991589 |
Statements
10 December 2018
0 references
permutations
0 references
graph domination
0 references
random algorithms
0 references
path graphs
0 references
asymptotics
0 references
math.CO
0 references
