Join-reachability problems in directed graphs

DOI10.1007/S00224-013-9450-7MaRDI QIDQ6828175zbMATH OpenFDO

Authors Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios

Publication date 5 February 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-013-9450-7

zbMATH Keywords

algorithmscombinatorial complexitydata structuresgraph algorithmsreachability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Join-reachability problems in directed graphs

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