An O(|V(G)|^6) algorithm for hypergraph immersion is claimed, but the proof has a false Mader-type lemma and applies a fixed-parameter theorem to a pattern that grows with the input.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Finding hypergraph immersion is fixed-parameter tractable
An O(|V(G)|^6) algorithm for hypergraph immersion is claimed, but the proof has a false Mader-type lemma and applies a fixed-parameter theorem to a pattern that grows with the input.