Login / Signup

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.

Haim KaplanRon ShamirRobert Endre Tarjan
Published in: SIAM J. Comput. (1999)
Keyphrases
  • np complete
  • perfect phylogeny
  • undirected graph
  • problems involving
  • data sets
  • reinforcement learning
  • pattern recognition
  • search space
  • application domains
  • constraint satisfaction
  • decision problems