Preventing unraveling in social networks: the anchored k-core problem
DOI10.1137/14097032XzbMATH Open1327.68173OpenAlexW1154358131MaRDI QIDQ5502104FDOQ5502104
Authors: Kshipra Bhawalkar, Kevin Lewi, Tim Roughgarden, Aneesh Sharma, Jon M. Kleinberg 
Publication date: 17 August 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/14097032x
Recommendations
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Can we create large \(k\)-cores by adding few edges?
- A parameterized complexity view on collapsing \(k\)-cores
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)
Cites Work
- A threshold of ln n for approximating set cover
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Lower bounds based on the exponential time hypothesis
- Communication and Coordination in Social Networks
- Automata, Languages and Programming
- Title not available (Why is that?)
- Submodularity of influence in social networks: from local to global
- Title not available (Why is that?)
- The statistical mechanics of strategic interaction
- Learning, Local Interaction, and Coordination
- Contagion
- Equilibrium pricing with positive externalities
Cited In (15)
- A parameterized complexity view on collapsing \(k\)-cores
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Percolation on the gene regulatory network
- Mathematical programming formulations for the collapsed k-core problem
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Partial immunization of trees
- Immunization in the threshold model: a parameterized complexity study
- Leave or not leave? Group members' departure prediction in dynamic information networks
- Building large \(k\)-cores from sparse graphs
- Building large \(k\)-cores from sparse graphs
- OCSM: finding overlapping cohesive subgraphs with minimum degree
- Vaccinate your trees!
- Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs
- Improving the core resilience of real-world hypergraphs
This page was built for publication: Preventing unraveling in social networks: the anchored \(k\)-core problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502104)
