4 Art�culos

Computational experiment on constructing fault-tolerant graph implementations with up to 9 vertices

Acceso

en l�nea

I.A.K. Kamil P�g. 43 - 47

In many applications, failure of a critical element of technical device or system where computers are used, outages or malfunctions can be expensive or even disastrous and can lead to progressive collapse. It is necessary to provide the ability to tolera... ver m�s

Revista: International Journal of Open Information Technologies Formato: Electr�nico

Tabla de contenido: Vol: 8 Num: 9 Par: 0 A�o: 2020

Construction of minimum vertex extensions of a graph by the Read-Faradzhev method

Acceso

en l�nea

I.A.K. Kamil,M.B. Abrosimov,A.A. Lobov P�g. 54 - 58

In 1976 John Hayes proposed a graph-based model to investigate node fault tolerance of discrete systems. A graph G* is vertex k-extension of a graph G if after removing any k vertices from G* result graph contains G. A vertex k-extension of the graph G i... ver m�s

Revista: International Journal of Open Information Technologies Formato: Electr�nico

Tabla de contenido: Vol: 8 Num: 4 Par: 0 A�o: 2020

« Anterior P�gina: 1 de 1 Siguiente »