A local algorithm for finding the bicomponents in a directed graph
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 18 (1978) no. 5, pp. 1345-1349
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_1978_18_5_a33,
author = {V. A. Evstigneev},
title = {A local algorithm for finding the bicomponents in a directed graph},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1345--1349},
year = {1978},
volume = {18},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1978_18_5_a33/}
}
TY - JOUR AU - V. A. Evstigneev TI - A local algorithm for finding the bicomponents in a directed graph JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1978 SP - 1345 EP - 1349 VL - 18 IS - 5 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1978_18_5_a33/ LA - ru ID - ZVMMF_1978_18_5_a33 ER -
V. A. Evstigneev. A local algorithm for finding the bicomponents in a directed graph. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 18 (1978) no. 5, pp. 1345-1349. http://geodesic.mathdoc.fr/item/ZVMMF_1978_18_5_a33/