\input zb-basic
\input zb-ioport
\iteman{io-port 06046516}
\itemau{Italiano, Giuseppe F.}
\itemti{Strong bridges and strong articulation points of directed graphs.}
\itemso{Bielikov\'a, M\'aria (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, \v{S}pindler{\uu}v Ml\'yn, Czech Republic, January 21--27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 43 (2012).}
\itemab
Summary: Given a directed graph G, an edge is a strong bridge if its removal increases the number of strongly connected components of G. Similarly, a vertex is a strong articulation point if its removal increases the number of strongly connected components of G. Strong articulation points and strong bridges are related to the notion of 2-vertex and 2-edge connectivity of directed graphs, which surprisingly seems to have been overlooked in the past. In this talk, we survey some very recent work in this area, both from the theoretical and the practical viewpoint.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{doi:10.1007/978-3-642-27660-6\_4}
\end