Login / Signup
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.
Aistis Atminas
Robert Brignall
Nicholas Korpelainen
Vadim V. Lozin
Vincent Vatter
Published in:
Electron. J. Comb. (2015)
Keyphrases
</>
data sets
special case
database
decision trees
bayesian networks
pairwise
random walk
shortest path
weighted graph