Linked Data Explorerhttp://worldcat.org/entity/work/id/20913130
A unified approach to path problems
We describe a general method for solving path problems on directed graphs. Such path problems include finding shortest paths, solving sparse systems of linear equations, and carrying out global flow analysis of computer programs. Our method consists of two steps. First, we construct a collection of regular expressions representing sets of paths in the graph. This can be done by using any standard algorithm, such as Gaussian or Gauss-Jordon elimination. Next, we apply a natural mapping from regular expressions into the given problem domain. We exhibit the mappings required to find shortest paths, solve sparse systems of linear equations, and carry out global flow analysis. Our results provide a general-purpose algorithm for solving any path problem, and show that the problem of constructing path expressions is in some sense the most general path problem. (Author).
Open All Close All
http://schema.org/about
- http://id.worldcat.org/fast/887978
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/mapping_transformations
- http://id.worldcat.org/fast/866237
- http://id.loc.gov/authorities/subjects/sh85003487
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/solutions_general
- http://id.loc.gov/authorities/subjects/sh85098679
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/sparse_matrix
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/optimization
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/numerical_mathematics
- http://id.worldcat.org/fast/939013
- http://id.worldcat.org/fast/805020
- http://id.loc.gov/authorities/subjects/sh85126327
- http://id.loc.gov/authorities/subjects/sh85056471
- http://id.loc.gov/authorities/subjects/sh85055284
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/gaussian_quadrature
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/paths
- http://id.worldcat.org/fast/1128743
- http://id.worldcat.org/fast/1008724
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/operations_research
- http://id.worldcat.org/fast/1430960
- http://id.loc.gov/authorities/subjects/sh85029346
- http://id.loc.gov/authorities/subjects/sh85053553
- http://id.loc.gov/authorities/subjects/sh85027654
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/network_flows
- http://id.worldcat.org/fast/943472
- http://experiment.worldcat.org/entity/work/data/20913130#Topic/graphs
- http://id.worldcat.org/fast/946584
- http://id.worldcat.org/fast/871540
- http://id.loc.gov/authorities/subjects/sh85080857
- http://id.loc.gov/authorities/subjects/sh85035862
http://schema.org/description
- "We describe a general method for solving path problems on directed graphs. Such path problems include finding shortest paths, solving sparse systems of linear equations, and carrying out global flow analysis of computer programs. Our method consists of two steps. First, we construct a collection of regular expressions representing sets of paths in the graph. This can be done by using any standard algorithm, such as Gaussian or Gauss-Jordon elimination. Next, we apply a natural mapping from regular expressions into the given problem domain. We exhibit the mappings required to find shortest paths, solve sparse systems of linear equations, and carry out global flow analysis. Our results provide a general-purpose algorithm for solving any path problem, and show that the problem of constructing path expressions is in some sense the most general path problem. (Author)."@en