Asymptotical estimation of some characteristics of finite graphs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)
- Volume: 11, Issue: 2, page 157-174
- ISSN: 0988-3754
Access Full Article
top
How to cite
topPhan Dinh Diêu. "Asymptotical estimation of some characteristics of finite graphs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.2 (1977): 157-174. <http://eudml.org/doc/92048>.
@article{PhanDinhDiêu1977,
author = {Phan Dinh Diêu},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {2},
pages = {157-174},
publisher = {EDP-Sciences},
title = {Asymptotical estimation of some characteristics of finite graphs},
url = {http://eudml.org/doc/92048},
volume = {11},
year = {1977},
}
TY - JOUR
AU - Phan Dinh Diêu
TI - Asymptotical estimation of some characteristics of finite graphs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 2
SP - 157
EP - 174
LA - eng
UR - http://eudml.org/doc/92048
ER -
References
top- 1. C. BERGE, Théorie des graphes et ses applications, Dunod, Paris, 1958. Zbl0088.15404MR102822
- 2. R. M. KARP, Reducibility among combinatorial problems, Technical Report n° 3, April 1972, Department of Computer Science, University of California, Berkeley. Zbl0366.68041MR378476
- 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). Zbl0251.94035MR225634
- 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. Zbl0306.94038MR414262
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.