01694nab a2200229 i 4500 publ34708 20240925091951.0 240925s2024 hu o 000 eng d 1435-246X 10.1007/s10100-023-00900-1 doi 34607749 mtmt SZTE Publicatio Repozitórium hun eng Homolya Viktor Closeness centrality reconstruction of tree graphs [elektronikus dokumentum] / Homolya Viktor 2024 1061-1088 CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 32 No. 4 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 length of the shortest paths between the node and all other nodes in the graph. Here we consider the case when the original graph is a tree and it is also known which nodes are the leaves. Based on some theoretical results, three algorithms are proposed. The first one aims at finding a non-exact solution G(P) in short time; the second one is a metaheuristic with some variants, they are intended to give further improvement on G(P); and the third one is designed for giving accurate results. Detailed explanations of these algorithms are given, together with numerical experiments to demonstrate their efficiency. Számítás- és információtudomány Vinkó Tamás aut http://publicatio.bibl.u-szeged.hu/34708/1/s10100-023-00900-1.pdf Dokumentum-elérés