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

DOI10.1006/JAGM.1995.1025MaRDI QIDQ4840217zbMATH OpenOpenAlexFDO

Authors Pilar de la Torre, Clyde Kruskal

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 graphsgreedy search problemslexicographic breadth-first searchlexicographic depth-first searchlexicographic topological-first search

Mathematics Subject Classification ID

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

Recommendations

• Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
• A parallel algorithm for the maximal path problem
• Fast parallel graph searching with applications
• Parallelism and the maximal path problem
• scientific article; zbMATH DE number 735432

Cited in

(5)

• 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
• Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search

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

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