Computing the closeness centralities of a type of the probabilistic neural networks

MaRDI QIDQ5065798zbMATH OpenFDO

Authors Tufan Turaci

Publication date 22 March 2022

zbMATH Keywords

network designcloseness centralitycommunicationsprobabilistic neural networksresidual closenessnormalized vertex residual closeness

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Stochastic network models in operations research (90B15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 6770087
• Closeness centrality in neural and interconnection networks
• Network robustness and residual closeness
• Closeness centrality in some splitting networks
• Computational complexity of network vulnerability analysis

Cited in

(1)

• Computational complexity of network vulnerability analysis

This page was built for publication: Computing the closeness centralities of a type of the probabilistic neural networks

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