V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction (Q5024904)
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: V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction |
scientific article; zbMATH DE number 7467525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction |
scientific article; zbMATH DE number 7467525 |
Statements
V–E Algorithm: A New Vital Vertex Identifying Algorithm Based on Vertex–Edge Interaction (English)
0 references
1 February 2022
0 references
complex networks
0 references
vital nodes identification
0 references
centrality measures
0 references
iterative algorithm
0 references
0.7343345284461975
0 references
0.706822395324707
0 references
0.6966503262519836
0 references
0.6822376847267151
0 references
0.6713728904724121
0 references
