Geodesic
Minimal graph cuts on network subgraphs
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 4, pp. 810-812

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{RM_2007_62_4_a16,
     author = {V. S. Lempitskii},
     title = {Minimal graph cuts on network subgraphs},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {810--812},
     publisher = {mathdoc},
     volume = {62},
     number = {4},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/}
}
TY  - JOUR
AU  - V. S. Lempitskii
TI  - Minimal graph cuts on network subgraphs
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2007
SP  - 810
EP  - 812
VL  - 62
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/
LA  - en
ID  - RM_2007_62_4_a16
ER  - 
%0 Journal Article
%A V. S. Lempitskii
%T Minimal graph cuts on network subgraphs
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2007
%P 810-812
%V 62
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/
%G en
%F RM_2007_62_4_a16
V. S. Lempitskii. Minimal graph cuts on network subgraphs. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 4, pp. 810-812. http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/