Advertisement

Unstructured path problems and the making of semirings

  • T. Lengauer
  • D. Theune
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

Abstract

The solution of the algebraic path problem, for instance with the algorithm by Floyd and Warshall, is part of the classical repertoire on algorithms. This solution presupposes that path costs are computed in a closed semiring or a similar algebraic structure. The associativity and distributivity laws in such algebraic structures exclude many possible path costs. In the seventies, several authors have developed algebraic methods in order to overcome such restrictions.

Recently, applications have created the need for handling such unstructured path costs. Motivated by such applications, we investigate the efficiency of algorithms solving path problems with unstructured costs. The resulting procedure allows for developing efficient algorithms for solving the algebraic path problem with respect to a wide variety of cost measures, including finding shortest paths with discounting, and counting paths or computing the expected length of paths with desired properties.

Keywords

Short Path Cost Structure Path Cost Neutral Element Edge Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Engineering. Addison-Wesley, Reading, MA, 1974.Google Scholar
  2. [2]
    R. C. Backhouse and B. A. Carré. Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and its Applications, 15:161–186, 1975.Google Scholar
  3. [3]
    J. Berstel. Transductions and Context-Free Languages. Teubner Verlag, Stuttgart, Germany, 1979.Google Scholar
  4. [4]
    J. Berstel and C. Reutenauer. Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science. Springer Verlag, New York, NY, 1984.Google Scholar
  5. [5]
    B. A. Carré. An algebra for network routing problems. Journal of the Institute of Mathematics and its Applications, 7:273–294, 1971.Google Scholar
  6. [6]
    B. A. Carré. Graphs and Networks. Oxford Applied Mathematics and Computing Science Series. Clarendon Press, 1979.Google Scholar
  7. [7]
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.Google Scholar
  8. [8]
    R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery, 32(3):505–536, 1985.Google Scholar
  9. [9]
    J. G. Fletcher. A more general algorithm for computing closed semiring costs between vertices of a directed graph. Communications of the Association for Computing Machinery, 23(6):350–351, 1980.Google Scholar
  10. [10]
    R. N. Floyd. Algorithm 97—shortest path. Communications of the Association for Computing Machinery, 5(6):345, 1962.Google Scholar
  11. [11]
    M. Gondran and M. Minoux. Graphs and Algorithms. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Chichester, U.K., 1984.Google Scholar
  12. [12]
    W. John. Remarks to the solution of EMC-problems on printed circuit boards. In Proceedings of the Seventh International Conference on Electromagnetic Compatbility, pages 68–72, York, U.K., 1990.Google Scholar
  13. [13]
    S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 3–40. Princeton University Press, Princeton, NJ, 1956.Google Scholar
  14. [14]
    T. Lengauer and D. Theune. Efficient algorithms for path problems with general cost criteria. In B. Monien and M. Rodriguez-Artalejo, editors, 18th International Symposium on Automata, Languages, and Programming, pages 314–326. Springer Lecture Notes in Computer Science, No. 510 Springer Verlag, New York, 1991.Google Scholar
  15. [15]
    G. Rote. A systolic array algorithm for the algebraic path problem (shortest path, matrix inversion). Computing, 34(3):191–219, 1985.Google Scholar
  16. [16]
    G. Rote. Path problems in graphs. Computing Supplement, 7:155–189, 1990.Google Scholar
  17. [17]
    R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594–614, 1981.Google Scholar
  18. [18]
    R. E. Tarjan. A unified approach to path problems. Journal of the Association for Computing Machinery, 28(3):577–593, 1981.Google Scholar
  19. [19]
    S. Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11–12, 1962.Google Scholar
  20. [20]
    A. Wongseelashote. Semirings and path spaces. Discrete Mathematics, 26:55–78, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • T. Lengauer
    • 1
  • D. Theune
    • 1
  1. 1.Cadlab and University of PaderbornPaderbornGermany

Personalised recommendations