No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 11689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No Polynomial Bound for the Chip Firing Game on Directed Graphs |
scientific article; zbMATH DE number 11689 |
Statements
25 June 1992
0 references
bound
0 references
chip firing game
0 references
directed graphs
0 references
No Polynomial Bound for the Chip Firing Game on Directed Graphs (English)
0 references
0.8961406350135803
0 references
0.8722677826881409
0 references
0.8722677826881409
0 references
0.8577986359596252
0 references
0.8461556434631348
0 references
