Mineurs d'arbres avec racines
Courcelle, B. ; Pariès, A.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995), p. 401-422 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1995-01-01
@article{ITA_1995__29_5_401_0,
     author = {Courcelle, B. and Pari\`es, A.},
     title = {Mineurs d'arbres avec racines},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {29},
     year = {1995},
     pages = {401-422},
     mrnumber = {1360667},
     zbl = {0838.68083},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1995__29_5_401_0}
}

Courcelle, B.; Pariès, A. Mineurs d'arbres avec racines. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) pp. 401-422. http://gdmltest.u-ga.fr/item/ITA_1995__29_5_401_0/

1. A. Aho, J. Hopcroft et J. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974. | MR 413592 | Zbl 0326.68005

2. I. Anderson, Combinatorics offinite sets, Clarendon Press, Oxford, 1987. | MR 892525 | Zbl 0604.05001

3. S. Arnborg, A. Proskurowski et D. Corneil, Forbidden minors characterization of partial 3-trees, Discrete Mathematics, 1990, 80, p. 1-19. | MR 1045920 | Zbl 0701.05016

4. N. De Bruin, C. A. Van Ebbenhorst et D. Kruyswijk, On the set of divisors of a number, Nieuw Arch. Wisk, 1952, 23, p. 191-193. | MR 43115 | Zbl 0043.04301

5. M. Fellows et M. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterization, Proceedings of "Foundations of Computer Science", 1989, p. 520-525.

6. M. Fellows, The Roberston-Seymour theorems: A survey of applications, A.M.S., Contemporary Mathematics, 1989, 89, p. 1-17. | MR 1006472 | Zbl 0692.68030

7. G. A. Ikorong, Arbres et largeur linéaires des graphes, Thèse, Université Joseph Fourier-Grenoble-I, 1992.

8. J. Matousek et R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Mathematics, 1992, 108, p. 343-364. | MR 1189856 | Zbl 0764.68128

9. A. Proskurowski, Graph reductions and techniques for finding minimal forbidden minors, dans Graph structure theory, N. ROBERTSON et P. SEYMOUR Eds., A.M.S., Contemporary Mathematics, 1993, 147, p. 591-600. | MR 1224733 | Zbl 0787.05032

10. N. Roberston et P. Seymour, Graph minors I: Excluding a forest, Journal of Combinatorial Theory, Series B, 1983, 35, p. 39-61. | MR 723569 | Zbl 0521.05062

11. N. Robertson et P. Seymour, Graph minors II: Algorithmic aspects of tree-width, Journal of algorithms, 1986, 7, p. 309-322. | MR 855559 | Zbl 0611.05017

12. N. Robertson et P. Seymour, Graph minors XIII: The disjoint paths problem, septembre 1986.

13. N. Robertson et P. Seymour, Graph minors XX: Wagner's conjecture, septembre 1988.