Iterative algorithm for computing irregularity strength of complete graph. (Q4684486)
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 6945745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative algorithm for computing irregularity strength of complete graph. |
scientific article; zbMATH DE number 6945745 |
Statements
1 October 2018
0 references
irregular assignment
0 references
irregularity strength
0 references
decrease and conquer
0 references
graph algorithms
0 references
computational complexity
0 references
0.8658778071403503
0 references
0.8089567422866821
0 references
0.7729696035385132
0 references
0.7551031112670898
0 references
