Two new lower bounds for maximum induced acyclic subgraph order in digraphs are proved by neighborhood refinement of the AGJS bound and by variance-plus-Bhatia-Davis analysis of a randomized algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved lower bounds for the maximum order of an induced acyclic subgraph
Two new lower bounds for maximum induced acyclic subgraph order in digraphs are proved by neighborhood refinement of the AGJS bound and by variance-plus-Bhatia-Davis analysis of a randomized algorithm.