A new approach in finding full friendly indices (Q1695616)
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 6835877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach in finding full friendly indices |
scientific article; zbMATH DE number 6835877 |
Statements
A new approach in finding full friendly indices (English)
0 references
7 February 2018
0 references
vertex labeling
0 references
friendly labeling
0 references
full friendly index set
0 references
full vertices blow-up
0 references
embedding labeling graph method
0 references
0 references
0.9230517745018004
0 references
0.922629714012146
0 references
0.8938000202178955
0 references
0.8867762684822083
0 references
0.8758286237716675
0 references
