Stable network topologies using the notion of covering

DOI10.1016/j.ejor.2011.12.001zbMath1244.90231OpenAlexW2064849124MaRDI QIDQ439583

Herman Monsuur, Réne H. P. Janssen

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.001

zbMATH Keywords

graph theorydegree distributionnetwork evolutioninformation networknetwork centric operations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Related Items

Heuristic decision making in network linking ⋮ Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors ⋮ Identifying stable network structures and sets of key players using a \(W\)-covering perspective ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Asymmetric flow networks ⋮ Communication network formation with link specificity and value transferability

Cites Work

• Unnamed Item
• Unnamed Item
• Stable and emergent network topologies: a structural approach
• A strategic model of social and economic networks
• Networks, Information and Choice
• Centers in Connected Undirected Graphs: An Axiomatic Approach
• Graphs and Cooperation in Games
• A Noncooperative Model of Network Formation
• Paths in graphs