The paper presents OptiUCF, an optimized algorithm that constructs a correct UCF-Index for (k,eta)-core queries on uncertain graphs by replacing division-based updates with on-demand dynamic programming recomputation.
Fast maximal clique enu- meration on uncertain graphs: A pivot-based approach
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Effective Index Construction Algorithm for Optimal $(k,\eta)$-cores Computation
The paper presents OptiUCF, an optimized algorithm that constructs a correct UCF-Index for (k,eta)-core queries on uncertain graphs by replacing division-based updates with on-demand dynamic programming recomputation.