A reinforcement learning agent that picks variable elimination orders using graph neural networks slightly reduces fill-in versus minimum degree and minimum fill-in heuristics on small test graphs.
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ReFill: Reinforcement Learning for Fill-In Minimization
A reinforcement learning agent that picks variable elimination orders using graph neural networks slightly reduces fill-in versus minimum degree and minimum fill-in heuristics on small test graphs.