Building large k-cores from sparse graphs

@inproceedings{Fomin2020BuildingLK,
  title={Building large k-cores from sparse graphs},
  author={F. Fomin and Danil Sagunov and Kirill Simonov},
  booktitle={MFCS},
  year={2020}
}
A popular model to measure network stability is the $k$-core, that is the maximal induced subgraph in which every vertex has degree at least $k$. For example, $k$-cores are commonly used to model the unraveling phenomena in social networks. In this model, users having less than $k$ connections within the network leave it, so the remaining users form exactly the $k$-core. In this paper we study the question whether it is possible to make the network more robust by spending only a limited amount… Expand

References

SHOWING 1-10 OF 43 REFERENCES
Can We Create Large k-Cores by Adding Few Edges?
  • 5
  • Highly Influential
  • PDF
A note on a theorem of Erdös & Gallai
  • 67
  • Highly Influential
  • PDF
Gráfok elő́ırt fokszámú pontokkal
  • Matematikai Lapok,
  • 1960
Understanding Edge Connectivity in the Internet through Core Decomposition
  • 4
  • Highly Influential
  • PDF
A survey of parameterized algorithms and the complexity of edge modification
  • 13
  • PDF
K-Core Maximization: An Edge Addition Approach
  • 13
  • PDF
Kernelization: Theory of Parameterized Preprocessing
  • 85
A Parameterized Complexity View on Collapsing k-Cores
  • 4
  • PDF
Tight lower bounds on the matching number in a graph with given maximum degree
  • 7
  • PDF
...
1
2
3
4
5
...