Skip to main content
SpringerLink
Log in

Shortest path problems and tree grammars: An algebraic framework

  • List Of Contributions
  • Conference paper
  • First Online:
Book cover Graph-Grammars and Their Application to Computer Science and Biology (Graph Grammars 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 73))

  • 175 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goguen, J.A.,Thatcher, J.W.,Wagner, E.G. and Wright, J.B., Initial Algebra Semantics and Continuous Algebras.J.Assoc.Comput.Mach.24, 1977, 68–95.

    Google Scholar 

  2. Arnold,A. and Nivet,M., Non Deterministic Recursive Program Schemes, Fundamentals of Computation Theory 1977,Lecture notes in Computer Science no56, Springer Verlag (1977), 12–21.

    Google Scholar 

  3. Martelli,A. and Montanari, U., Optimizing Decision Trees Through Heuristically Guided Search, Technical Report S-77-33, Computer Science Dept., Univ.of Pisa; also Comm.of the ACM, in press.

    Google Scholar 

  4. Engelfriet, J. and Schmidt, E.M., IO and OI, Daimi Report PB 47, University of Aarhus, Danmark (1975).

    Google Scholar 

  5. Bellman, R.E., Dynamic Programming, Princeton University Press, Princeton, N.J. 1957.

    Google Scholar 

  6. Karp, R.M. and Held, M., Finite State Processes and Dynamic Programming, SIAM J.Appl. Math., 15, 1957.

    Google Scholar 

  7. Martelli, A. and Montanari,U., On the Foundation of Dynamic Programming, Topics in Combinational Optimization (S.Rinaldi ed.), Springer Verlag, 1975, 145–163.

    Google Scholar 

  8. Martelli,A. and Montanari,U., Programmazione Dinamica e Punto Fisso, Atti del Convegno di Informatica Teorica, Mantova, November 1974.

    Google Scholar 

  9. Knuth, D.E., A Generalization of Dijkstra's Algorithm, Information Processing Letters, February 1977, 1–4.

    Google Scholar 

  10. Martelli,A. and Montanari, U., From Dynamic Programming to Search Algorithms with Functional Costs, Proc.Fourth Int.Joint Conf.on Artificial Intelligence, Tbilisi, September 1975, 345–350.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienze dell'Informazione, University of Pisa, Italy

    Alfonso Catalano, Stefania Gnesi & Ugo Montanari

Authors
  1. Alfonso Catalano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefania Gnesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Claus Hartmut Ehrig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Catalano, A., Gnesi, S., Montanari, U. (1979). Shortest path problems and tree grammars: An algebraic framework. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025719

Download citation

  • DOI: https://doi.org/10.1007/BFb0025719

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09525-5

  • Online ISBN: 978-3-540-35091-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation