C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.
Haim Kaplan
Ron Shamir
Robert 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