Login / Signup

On some hard and some tractable cases of the maximum acyclic matching problem.

Maximilian FürstDieter Rautenbach
Published in: Ann. Oper. Res. (2019)
Keyphrases
  • tractable cases
  • bounded treewidth
  • np hard
  • causal models
  • databases
  • logic programs
  • hard problems