Closeness centrality reconstruction of tree graphs
This paper deals with a problem which belongs to the general question: how to reconstruct a graph from limited amount of information. As given information, we use the closeness centrality, which assigns a non-negative number to each node of the graph in question: the reciprocal of the sum of the len...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2024
|
| Sorozat: | CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH
32 No. 4 |
| Tárgyszavak: | |
| doi: | 10.1007/s10100-023-00900-1 |
| mtmt: | 34607749 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/34708 |