Twinless strongly connected components

MaRDI QIDQ3447239zbMATH OpenFDO

Authors

Publication date 28 June 2007

zbMATH Keywords

linear time algorithmstrong connectivitydigraph augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Computing 2-twinless blocks
• On finding the strongly connected components in a directed graph
• 2-edge-twinless blocks
• Finding 2-edge and 2-vertex strongly connected components in quadratic time
• On the Strongly Connected and Biconnected Components of the Complement of Graphs

Cited in

(4)

• On 2-strong connectivity orientations of mixed graphs and related problems
• Computing 2-twinless blocks
• 2-edge-twinless blocks
• scientific article; zbMATH DE number 7765396 (Why is no real title available?)

This page was built for publication: Twinless strongly connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447239)