Layered graph traversals and Hamiltonian path problems — An algebraic approach-Reference-Cited by-同舟云学术

Layered graph traversals and Hamiltonian path problems — An algebraic approach

Published:1998 Issue: Volume: Page:96-121
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brunn Thomas,Möller Bernhard,Russling Martin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054287

Reference14 articles.

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman: The design and analysis of computer algorithms. Reading, Mass.: Addison Wesley 1974

2. R. Berghammer: unpublished manuscript

3. Biggs: Discrete Mathematics. Oxford: Clarendon Press 1989

4. T. Brunn: Deduktiver Entwurf und funktionale Programmierung von Graphenalgorithmen. Institut für Informatik, Universität Augsburg, Diplomarbeit, August 1997

5. J.H. Conway: Regular algebra and finite machines. London: Chapman and Hall 1971

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

1. On Algebra of Program Correctness and Incorrectness;Relational and Algebraic Methods in Computer Science;2021

2. Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive–transitive closures;Journal of Logical and Algebraic Methods in Programming;2015-05

3. Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures;Relational and Algebraic Methods in Computer Science;2012

4. A Functional Framework for Result Checking;Functional and Logic Programming;2010

5. Kleene Modules;Relational and Kleene-Algebraic Methods in Computer Science;2004