@article{Nigussie:DM:2007,
    Abstract = {Let I be any topological minor closed class of trees (a tree ideal). A classical theorem of Kruskal [Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture, Trans. Am. Math. Soc. 95 (1960) 210--223] states that the set O ( I ) of minimal non-members of I is finite. On the other hand, a finite structural description S ( I ) is developed by Robertson, et al. [Structural descriptions of lower ideals of trees, Contemp. Math. 147 (1993) 525--538]. Given either of the two finite characterizations of I , we present an algorithm that computes the other.},
    Author = {Nigussie, Yared},
    File = {Algorithm for finding structures and obstructions of tree ideals - Nigussie (0) (0) - a - a - o.pdf},
    ISSN = {0012-365X},
    Journal = {Discrete Mathematics},
    Keywords = {Structure-tree},
    Note = {EuroComb '03 - Graphs and AlgorithmsEuroComb '03 - Graphs and Agorithms},
    Number = {16},
    Pages = {2106 - 2111},
    Title = {Algorithm for finding structures and obstructions of tree ideals},
    URL = {http://www.sciencedirect.com/science/article/pii/S0012365X06007771},
    Volume = {307},
    Year = {2007},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0012365X06007771},
    bdsk-url-2 = {http://dx.doi.org/10.1016/j.disc.2005.12.054},
    date-added = {2016-01-17 10:28:52 +0000},
    date-modified = {2016-01-17 10:28:52 +0000},
    doi = {10.1016/j.disc.2005.12.054}
}

@article{Nigussie:DM:2007, Abstract = {Let I be any topological minor closed class of trees (a tree ideal). A classical theorem of Kruskal [Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture, Trans. Am. Math. Soc. 95 (1960) 210--223] states that the set O ( I ) of minimal non-members of I is finite. On the other hand, a finite structural description S ( I ) is developed by Robertson, et al. [Structural descriptions of lower ideals of trees, Contemp. Math. 147 (1993) 525--538]. Given either of the two finite characterizations of I , we present an algorithm that computes the other.}, Author = {Nigussie, Yared}, File = {Algorithm for finding structures and obstructions of tree ideals - Nigussie (0) (0) - a - a - o.pdf}, ISSN = {0012-365X}, Journal = {Discrete Mathematics}, Keywords = {Structure-tree}, Note = {EuroComb '03 - Graphs and AlgorithmsEuroComb '03 - Graphs and Agorithms}, Number = {16}, Pages = {2106 - 2111}, Title = {Algorithm for finding structures and obstructions of tree ideals}, URL = {http://www.sciencedirect.com/science/article/pii/S0012365X06007771}, Volume = {307}, Year = {2007}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0012365X06007771}, bdsk-url-2 = {http://dx.doi.org/10.1016/j.disc.2005.12.054}, date-added = {2016-01-17 10:28:52 +0000}, date-modified = {2016-01-17 10:28:52 +0000}, doi = {10.1016/j.disc.2005.12.054} }