An analysis of repeated graph search

DOI10.1007/978-3-030-33636-3_11zbMath1434.68344OpenAlexW2981202032MaRDI QIDQ2176684

Roland C. Backhouse

Publication date: 5 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-33636-3_11

zbMATH Keywords

directed graphrelation algebradepth-first searchstrongly connected componentregular algebra

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (1)

Components and acyclicity of graphs. An exercise in combining precision with concision

This page was built for publication: An analysis of repeated graph search