A linear algorithm of checking of the graph connectness

MaRDI QIDQ4898444zbMATH OpenFDO

Authors I. V. Dudchenko, M. V. Plakhotnyk

Publication date 2 January 2013

zbMATH Keywords

sorting algorithm

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 15657
• Connectivity of planar graphs
• Checking of deterministic graphs.
• On computing the connectivities of graphs and digraphs
• A simple 3-edge-connected component algorithm

Cited in

(4)

• An \(O(|V|^2)\) algorithm for single connectedness
• Strongly connected simply laced quivers and their eigenvectors.
• scientific article; zbMATH DE number 3950240 (Why is no real title available?)
• scientific article; zbMATH DE number 15657 (Why is no real title available?)

This page was built for publication: A linear algorithm of checking of the graph connectness

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