Twinless strongly connected components

zbMATH Open1113.90164MaRDI QIDQ3447239FDOQ3447239

Authors:

Publication date: 28 June 2007

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

zbMATH Keywords

linear time algorithmstrong connectivitydigraph augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (4)

• 2-edge-twinless blocks
• Computing 2-twinless blocks
• On 2-strong connectivity orientations of mixed graphs and related problems
• Title not available (Why is that?)

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)