Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions

@article{Sariyce2015FindingTH,
  title={Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions},
  author={Ahmet Erdem Sariy{\"u}ce and Seshadhri Comandur and Ali Pinar and {\"U}mit V. Çataly{\"u}rek},
  journal={ArXiv},
  year={2015},
  volume={abs/1411.3312}
}
  • Ahmet Erdem Sariyüce, Seshadhri Comandur, +1 author Ümit V. Çatalyürek
  • Published 2015
  • Computer Science
  • ArXiv
  • Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to find the "true optimum", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. Current dense… CONTINUE READING
    Peeling Bipartite Networks for Dense Subgraph Discovery
    • 19
    • PDF
    Efficient Algorithms for Densest Subgraph Discovery
    • 16
    • PDF
    Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
    • 56
    • Highly Influenced
    • PDF
    Local Algorithms for Hierarchical Dense Subgraph Discovery
    • 17
    • PDF
    Listing k-cliques in Sparse Real-World Graphs*
    • 33
    • PDF
    Large Scale Density-friendly Graph Decomposition via Convex Programming
    • 21
    • PDF
    Attribute-Driven Community Search
    • 71
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
    • 194
    • Highly Influential
    • PDF
    A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem
    • 20
    • Highly Influential
    • PDF
    Smallest-last ordering and clustering and graph coloring algorithms
    • 368
    • Highly Influential
    Network structure and minimum degree
    • 1,287
    • Highly Influential
    Trusses: Cohesive subgraphs for social network analysis
    • 2008
    On chromatic number of graphs and set-systems
    • 236
    • Highly Influential
    • PDF