A data structure for arc insertion and regular path finding

DOI10.1007/BF01530925zbMath0877.68032OpenAlexW3138718979MaRDI QIDQ1360677

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

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)

Related Items (2)

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

Cites Work

• On-line computation of transitive closures of graphs
• Amortized efficiency of a path retrieval data structure
• Finding paths and deleting edges in directed acyclic graphs
• Bounds in the propagation of selection into logic programs
• Amortized Computational Complexity
• Fast Algorithms for Solving Path Problems
• Unnamed Item

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