Shorter paths to graph algorithms-Reference-Cited by-同舟云学术

Shorter paths to graph algorithms

Published:1993 Issue: Volume: Page:250-268
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Möller Bernhard,Russling Martin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56625-2_17.pdf

Reference16 articles.

1. F.L. Bauer, R. Berghammer, M. Broy, W. Dosch, F. Geiselbrechtinger, R. Gnatz, E. Hangel, W. Hesse, B. Krieg-Brückner, A. Laut, T.A. Matzner, B. Möller, F. Nickl, H. Partsch, P. Pepper, K. Samelson, M. Wirsing, H. Wössner: The Munich project CIP. Volume I: The wide spectrum language CIP-L. Lecture Notes in Computer Science 183. Berlin: Springer 1985

2. F.L. Bauer, B. Möller, H. Partsch, P. Pepper: Formal program construction by transformations — Computer-aided, Intuition-guided Programming. IEEE Transactions on Software Engineering 15, 165–180 (1989)

3. R. Berghammer: A transformational development of several algorithms for testing the existence of cycles in a directed graph. Institut für Informatik der TU München, TUM-I8615

4. NATO ASI Series. Series F: Computer and systems sciences 55;R. Bird,1989

5. R.M. Burstall, J. Darlington: A transformation system for developing recursive programs. J. ACM 24, 44–67 (1977)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Layered graph traversals and Hamiltonian path problems — An algebraic approach;Lecture Notes in Computer Science;1998

2. Ideal Stream Algebra;Prospects for Hardware Foundations;1998

3. An initial-algebra approach to directed acyclic graphs;Lecture Notes in Computer Science;1994

4. Derivation of graph and pointer algorithms;Formal Program Development;1993