Density-friendly Graph Decomposition

@inproceedings{Tatti2015DensityfriendlyGD,
  title={Density-friendly Graph Decomposition},
  author={Nikolaj Tatti and Aristides Gionis},
  booktitle={WWW},
  year={2015}
}
Decomposing a graph into a hierarchical structure via k-core analysis is a standard operation in any modern graph-mining toolkit. k-core decomposition is a simple and efficient method that allows to analyze a graph beyond its mere degree distribution. More specifically, it is used to identify areas in the graph of increasing centrality and connectedness, and it allows to reveal the structural organization of the graph. Despite the fact that k-core analysis relies on vertex degrees, k-cores do… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Finding a maximum density subgraph

  • A. V. Goldberg
  • University of California Berkeley Technical…
  • 1984
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…