Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/65144
Title: | Fast algorithms for indices of nested split graphs approximating real complex networks |
Authors: | Sciriha, Irene Briffa, Johann A. Debono, Mark |
Keywords: | Threshold logic Computer science -- Mathematics Markov processes Simulated annealing (Mathematics) Mathematical physics Graph theory Chemistry -- Mathematics Resolvents (Mathematics) |
Issue Date: | 2018 |
Publisher: | Elsevier |
Citation: | Sciriha, I., Briffa, J. A., & Debono, M. (2018). Fast algorithms for indices of nested split graphs approximating real complex networks. Discrete Applied Mathematics, 247, 152-164. |
Abstract: | We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the geometrical properties of nested split graphs. Practical results are given for six graphs from such diverse areas as social networks, communication networks, word associations, and molecular chemistry. We present a critical analysis of the appropriate perturbation schemes that search the whole space of nested split graphs and the distance functions that gauge the dissimilarity between two graphs. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/65144 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FastAlgoSciBrif2018DAM247.pdf Restricted Access | 421.9 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.