Fast and efficient solution of path algebra problems
From MaRDI portal
Publication:1824392
DOI10.1016/0022-0000(89)90013-5zbMath0682.68055OpenAlexW2061420453MaRDI QIDQ1824392
Publication date: 1989
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(89)90013-5
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Graph theory (05C99)
Related Items
A dynamic separator algorithm, An efficient parallel algorithm for shortest paths in planar layered digraphs, The parallel computation of minimum cost paths in graphs by stream contraction, Efficient parallel algorithms for computing all pair shortest paths in directed graphs, On limits in complete semirings, Not all planar digraphs have small cycle separators, Flow in planar graphs with vertex capacities, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- How to multiply matrices faster
- Fast and efficient parallel solution of dense linear systems
- Dioïds and semirings: Links to fuzzy sets and other applications
- Fast and efficient linear programming and linear least-squares computations
- On a routing problem
- On multicommodity flows in planar graphs
- An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- A Separator Theorem for Planar Graphs
- Generalized Nested Dissection
- A Unified Approach to Path Problems
- Fast Algorithms for Solving Path Problems
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- Regular Algebra Applied to Path-finding Problems
- Fast parallel matrix and GCD computations
- An Algebra for Network Routing Problems
