# Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks

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.

## Authors

• 4 publications
• 6 publications
• 1 publication
• ### On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs

A (0,1)-matrix has the Consecutive Ones Property (C1P) for the rows if t...
06/27/2019 ∙ by Nina Pardal, et al. ∙ 0

• ### 2-nested matrices: towards understanding the structure of circle graphs

A (0,1)-matrix has the consecutive-ones property (C1P) if its columns ca...
03/05/2021 ∙ by Guillermo Durán, et al. ∙ 0

• ### Some remarks regarding Quaternions and Octonions

In this paper, we present some applications of quaternions and octonions...
11/28/2017 ∙ by Cristina Flaut, et al. ∙ 0

• ### Algorithms for deletion problems on split graphs

In the Split to Block Vertex Deletion and Split to Threshold Vertex Dele...
06/24/2019 ∙ by Dekel Tsur, et al. ∙ 0

• ### Ensembles of Nested Dichotomies with Multiple Subset Evaluation

A system of nested dichotomies is a method of decomposing a multi-class ...
09/08/2018 ∙ by Tim Leathart, et al. ∙ 0

• ### On bounds on bend number of split and cocomparability graphs

A path is a simple, piecewise linear curve made up of alternating horizo...
04/18/2018 ∙ by Dibyayan Chakraborty, et al. ∙ 0