Asymptotical estimation of some characteristics of finite graphs
Phan Dinh Diêu
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977), p. 157-174 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1977-01-01
@article{ITA_1977__11_2_157_0,
     author = {Phan Dinh Di\^eu},
     title = {Asymptotical estimation of some characteristics of finite graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {11},
     year = {1977},
     pages = {157-174},
     mrnumber = {445907},
     zbl = {0379.05053},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1977__11_2_157_0}
}

Phan Dinh Diêu. Asymptotical estimation of some characteristics of finite graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) pp. 157-174. http://gdmltest.u-ga.fr/item/ITA_1977__11_2_157_0/

1. C. Berge, Théorie des graphes et ses applications, Dunod, Paris, 1958. | MR 102822 | Zbl 0088.15404

2. R. M. Karp, Reducibility among combinatorial problems, Technical Report n° 3, April 1972, Department of Computer Science, University of California, Berkeley. | MR 378476

3. V. V. Glagolev, Some estimations of disjunctive normal forms of boolean functions. Problems of Cybernetics, v. 19, Moscow, 1967, p. 75-94 (in Russian). | MR 225634 | Zbl 0251.94035

4. Phan Dinh Diêu, On the complexity of the problem of state minimization for incompletely specified sequential automata. Elektronische Informations verarbeitung und Kybernetik, 11, 1975, p. 3-17. | MR 414262 | Zbl 0306.94038