On counting limited outdegree grid digraphs and greatest increase grid digraphs (Q258640)
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: On counting limited outdegree grid digraphs and greatest increase grid digraphs |
scientific article; zbMATH DE number 6553282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On counting limited outdegree grid digraphs and greatest increase grid digraphs |
scientific article; zbMATH DE number 6553282 |
Statements
On counting limited outdegree grid digraphs and greatest increase grid digraphs (English)
0 references
10 March 2016
0 references
directed graph
0 references
greatest increase grid graph
0 references
limited outdegree grid graph
0 references
discrete gradient ascent
0 references
enumeration
0 references
0.7060849070549011
0 references
0.6909580230712891
0 references
0.6899113059043884
0 references
0.6870365738868713
0 references
