PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 20, 2026Proceedings of the ACM on Management of Data1 citations

Efficient Counting-Based Approach for Nucleus Decomposition in Graphs

Nucleus Decomposition Revisited: An Efficient Counting-Based Approach

View Full Paper
Ask AI
Bookmark
Share

Authors

WZWenqian ZhangZYZhengyi YangDWDong Wen

Discussion

Loading...

Member takes

Overview

This randomized trial demonstrates improved efficiency in hierarchy construction and nucleus decomposition in graphs using a novel counting method.

Key Points

  • The study aims to enhance nucleus decomposition by eliminating the need for explicit enumeration of s-cliques.
  • Introduced a counting-based approach minimizing s-clique enumeration.
  • Developed the Clique Path Index for efficient management of the s-clique search space.
  • Conducted extensive experiments on real-world datasets.
  • Achieved an average speedup of one order of magnitude in nucleus decomposition tasks.
  • Enhanced performance showed up to two orders of magnitude improvements for hierarchy construction.
  • Method successfully scaled to larger s and denser graphs without timing out.

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/6a0d5013f03e14405aa9ba0chttps://doi.org/10.1145/3802092
View Full Paper
Ask AI
Bookmark
Share