CriticalSet identifies the k contributors whose removal isolates the largest number of items in a bipartite dependency network, solved via ShapleyCov centrality derived from the Shapley value and the linear-time MinCov peeling algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The CriticalSet problem: Identifying Critical Contributors in Bipartite Dependency Networks
CriticalSet identifies the k contributors whose removal isolates the largest number of items in a bipartite dependency network, solved via ShapleyCov centrality derived from the Shapley value and the linear-time MinCov peeling algorithm.