Introduces the NP-hard edge k-core maximization problem via budget-b edge additions and proposes a heuristic algorithm tested on real datasets.
Complexity classification of some edge modification problems
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
-
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.