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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SI 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Introduces the NP-hard edge k-core maximization problem via budget-b edge additions and proposes a heuristic algorithm tested on real datasets.
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.
-
K-Core Maximization through Edge Additions
Introduces the NP-hard edge k-core maximization problem via budget-b edge additions and proposes a heuristic algorithm tested on real datasets.