scientific article; zbMATH DE number 871918

zbMATH Open0848.68075MaRDI QIDQ4875189FDOQ4875189

Authors: Sanjeev Khanna, Randall H. Wilson, Rajeev Motwani 

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

connectivitydynamic graph algorithmsundirected graph problems

Mathematics Subject Classification ID

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

Cited In (5)

• On certificates and lookahead in dynamic graph problems
• Title not available (Why is that?)
• DFS is unsparsable and lookahead can help in maximal matching
• Dynamic matrix rank with partial lookahead
• Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains

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)