Algorithms for transitive closure

DOI10.1016/S0020-0190(01)00245-9zbMath1013.68140OpenAlexW2075704325MaRDI QIDQ1603584

A. Koubková, Václav Koubek

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00245-9

zbMATH Keywords

algorithmscomputational complexitygraph algorithmstransitive closure

Mathematics Subject Classification ID

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

Related Items

Determining operations affected by delay in predictive train timetables, Algorithms for computing the optimal transitive approximation of a proximity relation

Cites Work

• An improved algorithm for transitive closure on acyclic digraphs
• On the computational power of pushdown automata
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item