Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search

DOI10.1007/s00224-001-1008-4zbMath0992.68233OpenAlexW2031313188MaRDI QIDQ5949570

Clyde P. Kruskal, Pilar de la Torre

Publication date: 21 November 2001

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

Full work available at URL: https://doi.org/10.1007/s00224-001-1008-4

zbMATH Keywords

lexicographic search problemsNC-algorithmsreducible flow graphs

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Depth-first search in directed planar graphs, revisited ⋮ Depth-First Search Using $$O(n)$$ Bits ⋮ A model classifying algorithms as inherently sequential with applications to graph searching

This page was built for publication: Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search