RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
Prikl. Diskr. Mat.,
2008
Number 2(2),
Pages
107–112
(Mi pdm44)
This article is cited 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.
UDC:
519.17:681.3
Fulltext:
PDF file (269 kB)
Cited by
©
Steklov Math. Inst. of RAS
, 2026