scientific article; zbMATH DE number 871918

MaRDI QIDQ4875189zbMATH OpenFDO

Authors Sanjeev Khanna, Randall H. Wilson, Rajeev Motwani

Publication date 28 April 1996

zbMATH Keywords

connectivitydynamic graph algorithmsundirected graph problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On certificates and lookahead in dynamic graph problems
• Fast dynamic transitive closure with lookahead
• scientific article; zbMATH DE number 2089225
• Improved Dynamic Reachability Algorithms for Directed Graphs

Cited in

(5)

• Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
• scientific article; zbMATH DE number 2089225 (Why is no real title available?)
• On certificates and lookahead in dynamic graph problems
• Dynamic matrix rank with partial lookahead
• DFS is unsparsable and lookahead can help in maximal matching

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 Q4875189)