Geodesic
On unconditional edge tests for some families of graphs
Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 4, pp. 8-30.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2003_10_4_a1,
     author = {E. V. Debrev},
     title = {On unconditional edge tests for some families of graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {8--30},
     publisher = {mathdoc},
     volume = {10},
     number = {4},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2003_10_4_a1/}
}
TY  - JOUR
AU  - E. V. Debrev
TI  - On unconditional edge tests for some families of graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2003
SP  - 8
EP  - 30
VL  - 10
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2003_10_4_a1/
LA  - ru
ID  - DA_2003_10_4_a1
ER  - 
%0 Journal Article
%A E. V. Debrev
%T On unconditional edge tests for some families of graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2003
%P 8-30
%V 10
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2003_10_4_a1/
%G ru
%F DA_2003_10_4_a1
E. V. Debrev. On unconditional edge tests for some families of graphs. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 4, pp. 8-30. http://geodesic.mathdoc.fr/item/DA_2003_10_4_a1/

[1] Baranov V. I., Stechkin B. S., Ekstremalnye kombinatornye zadachi i ikh prilozheniya, Nauka, M., 1989 | MR

[2] Debrev E. V., “Ob odnoi zadache kombinatornogo poiska”, Diskretnaya matematika, 14:3 (2002), 8–17 | MR | Zbl

[3] Debrev E. V., “O razlichenii grafov iz nekotorykh mnozhestv posredstvom bezuslovnykh rebernykh testov”, Matematicheskie voprosy kibernetiki, no. 11, Nauka, M., 2002, 177–192 | MR

[4] Emelichev V A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I., Lektsii po teorii grafov, Nauka, M., 1990 | MR | Zbl

[5] Moshkov M. Yu., Derevya reshenii. Teoriya i prilozheniya, Izd-vo Nizhegorodskogo universiteta, Nizhnii Novgorod, 1994

[6] Nechiporuk E. I., “O topologicheskikh printsipakh samokorrektirovaniya”, Problemy kibernetiki, no. 21, Nauka, M., 1969, 5–102

[7] Ore O., Teoriya grafov, Nauka, M., 1980 | MR

[8] Solovev N. A., Testy (teoriya, postroenie, primenenie), Nauka, Novosibirsk, 1978 | MR

[9] Chegis I. A., Yablonskii S. V., “Logicheskie sposoby kontrolya elektricheskikh skhem”, Sbornik statei po matematicheskoi logike i ee prilozheniyam k nekotorym voprosam kibernetiki, Trudy matematicheskogo in-ta im. V. A. Steklova, LI, Izd-vo AN SSSR, M., 1958, 270–360

[10] Erdesh P., Spenser Dzh., Veroyatnostnye metody v kombinatorike, Mir, M., 1976 | MR

[11] Yablonskii S. V., “Nekotorye voprosy nadezhnosti i kontrolya upravlyayuschikh sistem”, Matematicheskie voprosy kibernetiki, no. 1, Nauka, M., 1988, 5–25 | MR

[12] Aigner M., Combinatorial search, Wiley-Teubner Series in Computer Science, John Willey Sons, Ltd., B-G. Teubner, Chichester, Stuttgart, 1988 | MR

[13] Grebinski V., Recherche combinatoire: probl`emes de pesage, reconstruction de graphes et applications, Diplǒme de doctorat de l'Université Henri Poincaré, 1998

[14] Grebinski V., Kucherov G., “Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs”, Proc. of 5th Israeli symposium on theory of computing and systems, IEEE Press, Los Alamitos, 1997, 166–173