Login / Signup
Graph minors. IV. Tree-width and well-quasi-ordering.
Neil Robertson
Paul D. Seymour
Published in:
J. Comb. Theory, Ser. B (1990)
Keyphrases
</>
tree width
tree decomposition
structural properties
constraint networks
shortest path
exact and approximate
computationally challenging
answer set programming
database
bayesian networks
probabilistic reasoning
decomposition method
relational structures
series parallel