Introduces the NP-hard k-truss minimization problem for critical edge identification and supplies pruning rules plus an upper-bound strategy to solve it on real social networks.
On asymptotic cost of triangle listing in random graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Critical Edge Identification: A K-Truss Based Model
Introduces the NP-hard k-truss minimization problem for critical edge identification and supplies pruning rules plus an upper-bound strategy to solve it on real social networks.