PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS (Q3348414)
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 RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS |
scientific article; zbMATH DE number 4199625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS |
scientific article; zbMATH DE number 4199625 |
Statements
PARALLEL RECOGNITION ALGORITHMS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS (English)
0 references
1990
0 references
threshold graphs
0 references
parallel recognition algorithms
0 references
degree sequences
0 references
0.8343616724014282
0 references
0.8129257559776306
0 references
0.8117496967315674
0 references
0.8068646192550659
0 references
0.8049672842025757
0 references
