Parallel enumeration of degree sequences of simple graphs (Q5167101)
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: Parallel enumeration of degree sequences of simple graphs |
scientific article; zbMATH DE number 6315452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel enumeration of degree sequences of simple graphs |
scientific article; zbMATH DE number 6315452 |
Statements
9 July 2014
0 references
simple directed graphs
0 references
approximate filtering algorithms
0 references
approximate reconstruction algorithms
0 references
linear Havel-Hakimi algorithm
0 references
0.9638819098472596
0 references
0.8662864565849304
0 references
0.8033962845802307
0 references
0.7844277620315552
0 references
0.7762425541877747
0 references
