Estimating the global density of graphs by a sparseness index

DOI10.1016/J.AMC.2013.08.040MaRDI QIDQ278982zbMATH OpenOpenAlexFDO

Authors Salvatore Menniti, Emanuele Castagna, Tommaso Mazza

Publication date 27 April 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2013.08.040

zbMATH Keywords

sparse matrixbiological networksnetwork connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Systems biology, networks (92C42) Connectivity (05C40) Density (toughness, etc.) (05C42)

Recommendations

• scientific article; zbMATH DE number 3923468
• Sparsity measure of a network graph: Gini index
• scientific article; zbMATH DE number 17137
• Sparsity. Graphs, structures, and algorithms
• Graph extensions and some optimization problems in sparse matrix computations

Cited in

(2)

• Metrics for sparse graphs
• Sparsity measure of a network graph: Gini index

This page was built for publication: Estimating the global density of graphs by a sparseness index

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