Choosing a leader on a complex network

DOI10.1016/J.CAM.2006.04.024zbMATH Open1127.90015OpenAlexW2057313680MaRDI QIDQ879402FDOQ879402

María Isabel González Vasco, J. Pello, Julio Flores, Regino Criado

Publication date: 11 May 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2006.04.024

zbMATH Keywords

communication networknetwork efficiencynetwork vulnerabilityintentional attacktechnical failure

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• The Structure and Function of Complex Networks
• Exploring complex networks
• How the science of complex networks can help developing strategies against terrorism
• New results on computable efficiency and its stability for complex networks
• Effective measurement of network vulnerability under random and intentional attacks

Cited In (12)

• Title not available (Why is that?)
• Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them
• Leader election in complete networks
• Reducing the vulnerability of network by inserting modular topologies
• A model to classify users of social networks based on PageRank
• Multiscale vulnerability of complex networks
• On the localization of the personalized PageRank of complex networks
• A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
• ( ψ , p , q ) -vulnerabilities: A unified approach to network robustness
• Competitivity groups on social network sites
• A Theoretical Study of Different Leader Roles in Networks
• Joint Centrality Distinguishes Optimal Leaders in Noisy Networks

This page was built for publication: Choosing a leader on a complex network

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