scientific article; zbMATH DE number 1496421

MaRDI QIDQ4500615zbMATH OpenFDO

Authors William F. Klostermeyer

Publication date 12 February 2001

zbMATH Keywords

connectivitydigraphdynamic algorithmreachability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time
• Algorithms and Computation
• Incremental 2-edge-connectivity in directed graphs
• Improved Dynamic Reachability Algorithms for Directed Graphs

Cited in

(2)

• A topological approach to dynamic graph connectivity
• Finding paths and deleting edges in directed acyclic graphs

This page was built for publication:

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