Connected components and minimum paths

MaRDI QIDQ3108686zbMATH OpenFDO

Authors Charles M. Rader

Publication date 5 January 2012

zbMATH Keywords

adjacency matrixgraph algorithmshortest pathsstrongly connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 4147534
• Graphs and graph algorithms
• scientific article; zbMATH DE number 3930349
• A spectral approach to the shortest path problem
• An optimal algorithm for the period of a strongly connected digraph

Cited in

(4)

• Minimum-link paths revisited
• Finding paths with minimum shared edges
• scientific article; zbMATH DE number 1839614 (Why is no real title available?)
• Algebraic investigation of connected components

This page was built for publication: Connected components and minimum paths

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