New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast Enumeration of Minimal Removable Sets in Monotone Systems with Application to Core Collapse Analysis
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.