The core decomposition of networks: theory, algorithms and applications

@article{Malliaros2019TheCD,
  title={The core decomposition of networks: theory, algorithms and applications},
  author={Fragkiskos D. Malliaros and Christos Giatsidis and Apostolos N. Papadopoulos and Michalis Vazirgiannis},
  journal={The VLDB Journal},
  year={2019},
  pages={1 - 32}
}
The core decomposition of networks has attracted significant attention due to its numerous applications in real-life problems. Simply stated, the core decomposition of a network (graph) assigns to each graph node v, an integer number c(v) (the core number), capturing how well v is connected with respect to its neighbors. This concept is strongly related to the concept of graph degeneracy, which has a long history in graph theory. Although the core decomposition concept is extremely simple… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 154 REFERENCES

Efficient Probabilistic K-Core Computation on Uncertain Graphs

  • 2018 IEEE 34th International Conference on Data Engineering (ICDE)
  • 2018
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Generalized Cores

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Core Decomposition of Massive, Information-Rich Graphs

  • Encyclopedia of Social Network Analysis and Mining. 2nd Ed.
  • 2018
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Core decomposition in large temporal graphs

  • 2015 IEEE International Conference on Big Data (Big Data)
  • 2015
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Evaluating Cooperation in Communities with the k-Core Structure

  • 2011 International Conference on Advances in Social Networks Analysis and Mining
  • 2011
VIEW 4 EXCERPTS

The Web as a Graph

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL