Prikladnaâ diskretnaâ matematika, no. 2 (2008), pp. 107-112
Citer cet article
V. A. Melent'ev. Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components. Prikladnaâ diskretnaâ matematika, no. 2 (2008), pp. 107-112. http://geodesic.mathdoc.fr/item/PDM_2008_2_a22/
@article{PDM_2008_2_a22,
author = {V. A. Melent'ev},
title = {Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {107--112},
year = {2008},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2008_2_a22/}
}
TY - JOUR
AU - V. A. Melent'ev
TI - Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components
JO - Prikladnaâ diskretnaâ matematika
PY - 2008
SP - 107
EP - 112
IS - 2
UR - http://geodesic.mathdoc.fr/item/PDM_2008_2_a22/
LA - ru
ID - PDM_2008_2_a22
ER -
%0 Journal Article
%A V. A. Melent'ev
%T Searching $(s,t)$-cutsets of computing system graph with diameter limiting of connected components
%J Prikladnaâ diskretnaâ matematika
%D 2008
%P 107-112
%N 2
%U http://geodesic.mathdoc.fr/item/PDM_2008_2_a22/
%G ru
%F PDM_2008_2_a22
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.
