A data structure for arc insertion and regular path finding

DOI10.1007/BF01530925MaRDI QIDQ1360677zbMATH OpenOpenAlexFDO

Authors Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter

Publication date 27 November 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01530925

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Recommendations

• Finding Regular Simple Paths in Graph Databases
• Dynamic graph queries
• Amortized efficiency of a path retrieval data structure
• scientific article; zbMATH DE number 2090027
• scientific article; zbMATH DE number 140481

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Amortized Computational Complexity
• Amortized efficiency of a path retrieval data structure
• Bounds in the propagation of selection into logic programs
• Fast Algorithms for Solving Path Problems
• Finding paths and deleting edges in directed acyclic graphs
• On-line computation of transitive closures of graphs

Cited in

(2)

• A simple and deterministic competitive algorithm for online facility location
• Regular path queries with constraints

This page was built for publication: A data structure for arc insertion and regular path finding

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