Traversal games in K-shell decomposition
From MaRDI portal
Cites work
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- Centrality measures and opinion dynamics in two-layer networks with replica nodes
- Complexity of the path avoiding forbidden pairs problem revisited
- Computational Aspects of Cooperative Game Theory
- Contributions to the Theory of Games (AM-40), Volume IV
- Cooperation through social influence
- Data clustering via cooperative games: a novel approach and comparative study
- Finding and listing induced paths and cycles
- Forms of representation for simple games: sizes, conversions and equivalences
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Influence decision models: from cooperative game theory to social network analysis
- Local search for constrained graph clustering in biological networks
- On the complexity of paths avoiding forbidden pairs
- On the likelihood of dummy players in weighted majority games
- Reconfiguring shortest paths in graphs
- Social disruption games in signed networks
- Soft happy colourings and community structure of networks
This page was built for publication: Traversal games in K-shell decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7362158)
