Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems

DOI10.1006/jagm.1995.1025zbMath0849.68050OpenAlexW2026678693MaRDI QIDQ4840217

Clyde P. Kruskal, Pilar de la Torre

Publication date: 24 July 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1025

zbMATH Keywords

directed graphslexicographic breadth-first searchlexicographic depth-first searchgreedy search problemslexicographic topological-first search

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (4)

Depth-first search in directed planar graphs, revisited ⋮ Depth-First Search Using $$O(n)$$ Bits ⋮ An algebraic framework for multi-objective and robust variants of path problems ⋮ Additive tree 2-spanners of permutation graphs

This page was built for publication: Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems