|
Prikladnaya Diskretnaya Matematika, 2008, Number 2(2), Pages 107–112
(Mi pdm44)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Foundations of Reliability of Computing and Control Systems
Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components
V. A. Melent'ev Institute of Semiconductor Physics of SB RAS, Novosibirsk
Abstract:
An approach to searching the minimum $d$-limited $(s,t)$-cutsets in computer system graph is presented. The approach is based on bracket images and projections of the graph.
Citation:
V. A. Melent'ev, “Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components”, Prikl. Diskr. Mat., 2008, no. 2(2), 107–112
Linking options:
https://www.mathnet.ru/eng/pdm44 https://www.mathnet.ru/eng/pdm/y2008/i2/p107
|
Statistics & downloads: |
Abstract page: | 279 | Full-text PDF : | 98 | First page: | 1 |
|