O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A spectral basis truncation in space and quadrature in time is analyzed for approximating fractional stochastic evolution equations, with strong error bounds proved and verified numerically.
citing papers explorer
-
Maximum Independent Sets in Disk Graphs with Disks in Convex Position
O(n^3 log n) algorithm computes maximum (weighted) independent sets for disk graphs with all disks on the convex hull, plus O(n^3 log^2 n) for k-dispersion on the same inputs.
-
Spectral approximation of a new class of stochastic fractional evolution equations
A spectral basis truncation in space and quadrature in time is analyzed for approximating fractional stochastic evolution equations, with strong error bounds proved and verified numerically.