Computational complexity of graph extensions | Applied Discrete Mathematics. Supplement. 2009. № 1.

HomeIssuesComputational complexity of graph extensions | Applied Discrete Mathematics. Supplement. 2009. № 1.

Computational complexity of graph extensions

Download file
Counter downloads: 273

Keywords

Authors

NameOrganizationE-mail
Abrosimov M. B.Saratov State Universitymic@rambler.ru
Всего: 1

References

Hayes J. P. A graph model for fault-tolerant computing system / / IEEE Trans. Comput. 1976. V.C.-25. No. 9. P. 875-884.
Harary F., Hayes J. P. Edge fault tolerance in graphs / / Networks. 1993. V. 23. P. 135-142.
Harary F., Hayes J. P. Node fault tolerance in graphs / / Networks. 1996. V. 27. P. 19-23.
Абросимов М. Б. Минимальные расширения графов / / Новые информационные технологии в исследовании дискретных структур. Томск, 2008. С. 59-64.
Computational complexity of graph extensions | Applied Discrete Mathematics. Supplement. 2009. № 1.

Computational complexity of graph extensions | Applied Discrete Mathematics. Supplement. 2009. № 1.