Updating , <-chains

DOI10.1016/S0020-0190(01)00278-2MaRDI QIDQ294886zbMATH OpenOpenAlexFDO

Authors James Delgrande, Arvind Kumar Gupta

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019001002782?np=y

zbMATH Keywords

algorithmsdata structurestemporal reasoningefficient reasoning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Logic in artificial intelligence (68T27)

Recommendations

• A uniform approach to semi-dynamic problems on digraphs
• Speeding up dynamic transitive closure for bounded degree graphs
• Faster Algorithms for Incremental Topological Ordering
• Maintaining chordal graphs dynamically: improved upper and lower bounds
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Efficient algorithms for qualitative reasoning about time
• Graph theory with applications

Cited in

(1)

• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class

This page was built for publication: Updating \(\leqslant, <\)-chains

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