The paper introduces the ACS-PP problem and an efficient PP-FP search algorithm using public global and private PP-FP-tree indices to find connected k-core communities sharing maximum keywords with the query in public-private graphs.
A convex-programming approach for efficient directed densest subgraph discovery,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Community Search on Attributed Public-Private Graphs
The paper introduces the ACS-PP problem and an efficient PP-FP search algorithm using public global and private PP-FP-tree indices to find connected k-core communities sharing maximum keywords with the query in public-private graphs.