Closeness centrality reconstruction of tree graphs

DOI10.1007/s10100-023-00900-1WikidataQ129181782 ScholiaQ129181782MaRDI QIDQ6661230

Viktor Homolya, Tamás Vinkó

Publication date: 13 January 2025

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

zbMATH Keywords

heuristicsgraph theorycloseness centralityreconstruction from centrality

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization by Simulated Annealing
• A congruence theorem for trees
• An optimal algorithm to reconstruct trees from additive distance data
• A note on a theorem of Erdős and Gallai
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Exact matrix completion via convex optimization
• Statistical mechanics of complex networks
• A remark on the existence of finite graphs
• Degree-based graph construction
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• The Change-Making Problem
• On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
• Distance matrix of a graph and its realizability
• Networks

Related Items (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)