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.
Johnson, Mihalis Yannakakis, and Christos H
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Presents an adaptive approximation algorithm for general linear-multi-parametric optimization problems that generalizes prior methods to negative parameters and arbitrary sets, with structural results on parameter transformations and a negative result on approximability conditions.
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
citing papers explorer
-
On the enumeration of Tarski fixed points
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.