Closeness centrality reconstruction of tree graphs

DOI10.1007/S10100-023-00900-1MaRDI QIDQ6661230zbMATH OpenWikidataFDO

Authors Viktor Homolya, Tamás Vinkó

Publication date 13 January 2025

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10100-023-00900-1

zbMATH Keywords

closeness centralitygraph theoryheuristicsreconstruction from centrality

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Closeness centrality in neural and interconnection networks
• Networks with extremal closeness
• Reconstruction of graphs based on random walks
• Closeness of splitting graphs
• A generalized algorithm for centrality problems on trees

Cites work

• A congruence theorem for trees
• A note on a theorem of Erdős and Gallai
• A remark on the existence of finite graphs
• An optimal algorithm to reconstruct trees from additive distance data
• Degree-based graph construction
• Distance matrix of a graph and its realizability
• Exact matrix completion via convex optimization
• scientific article; zbMATH DE number 2089760 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Networks. An introduction.
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the swap-distances of different realizations of a graphical degree sequence
• Optimization by simulated annealing
• Statistical mechanics of complex networks
• The Change-Making Problem
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

Cited in

(1)

• Overview of Hungarian operations research based on the VOCAL 2022 conference

This page was built for publication: Closeness centrality reconstruction of tree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661230)