Bijoin points, bibridges, and biblocks of directed graphs

DOI10.1007/BF01099359zbMath0462.05034MaRDI QIDQ3912819

G. G. Svetlov, Ya. M. Erusalimskii

Publication date: 1980

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

biconnectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

On computing the 2-vertex-connected components of directed graphs, Strong Connectivity in Directed Graphs under Failures, with Applications, Finding strong bridges and strong articulation points in linear time, Computing the 2-blocks of directed graphs

Cites Work

• Unnamed Item