@article{ITA_1977__11_2_157_0, author = {Phan Dinh Di\^eu}, title = {Asymptotical estimation of some characteristics of finite graphs}, journal = {RAIRO. Informatique th\'eorique}, pages = {157--174}, publisher = {Centrale des revues, Dunod-Gauthier-Villars}, address = {Montreuil}, volume = {11}, number = {2}, year = {1977}, mrnumber = {445907}, zbl = {0379.05053}, language = {en}, url = {http://archive.numdam.org/item/ITA_1977__11_2_157_0/} }
TY - JOUR AU - Phan Dinh Diêu TI - Asymptotical estimation of some characteristics of finite graphs JO - RAIRO. Informatique théorique PY - 1977 SP - 157 EP - 174 VL - 11 IS - 2 PB - Centrale des revues, Dunod-Gauthier-Villars PP - Montreuil UR - http://archive.numdam.org/item/ITA_1977__11_2_157_0/ LA - en ID - ITA_1977__11_2_157_0 ER -
%0 Journal Article %A Phan Dinh Diêu %T Asymptotical estimation of some characteristics of finite graphs %J RAIRO. Informatique théorique %D 1977 %P 157-174 %V 11 %N 2 %I Centrale des revues, Dunod-Gauthier-Villars %C Montreuil %U http://archive.numdam.org/item/ITA_1977__11_2_157_0/ %G en %F ITA_1977__11_2_157_0
Phan Dinh Diêu. Asymptotical estimation of some characteristics of finite graphs. RAIRO. Informatique théorique, Tome 11 (1977) no. 2, pp. 157-174. http://archive.numdam.org/item/ITA_1977__11_2_157_0/
1. Théorie des graphes et ses applications, Dunod, Paris, 1958. | MR | Zbl
,2. Reducibility among combinatorial problems, Technical Report n° 3, April 1972, Department of Computer Science, University of California, Berkeley. | MR
,3. Some estimations of disjunctive normal forms of boolean functions. Problems of Cybernetics, v. 19, Moscow, 1967, p. 75-94 (in Russian). | MR | Zbl
,4. 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 | Zbl
,