Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach

Using an algebra of paths we present abstract algebraic derivations for two problem classes concerning graphs, viz. layer oriented traversal and computing sets of Hamiltonian paths. In the first case, we are even able to abstract to the very general setting of Kleene algebras. Applications include reachability and a shortest path problem as well as topological sorting and finding maximum cardinality matchings.

[1]  Martin Russling.  Deriving General Schemes for Classes of Graph Algorithms , 1996 .

[2]  Bernhard Möller,et al.  Shorter Paths to Graph Algorithms , 1992, Sci. Comput. Program..

[3]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[4]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[5]  J. Conway.  Regular algebra and finite machines , 1971 .

[6]  Ronald L. Rivest,et al.  The Design and Analysis of Computer Algorithms , 1990 .

[7]  Gunther Schmidt,et al.  Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.

[8]  Higher-Order Algebra, Logic, and Term Rewriting , 1995, Lecture Notes in Computer Science.

[9]  Tobias Nipkow,et al.  Higher-Order Algebra, Logic, and Term Rewriting , 1993, Lecture Notes in Computer Science.

[10]  Abraham Kandel,et al.  Discrete mathematics for computer scientists , 1983 .

[11]  Bernhard Möller,et al.  Derivation of Graph and Pointer Algorithms , 1993, Formal Program Development.

[12]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[13]  Bernhard Möller,et al.  Assertions and Recursions , 1995, HOA.

[14]  Bernhard Möller,et al.  Formal Program Development , 1993, Lecture Notes in Computer Science.

[15]  Martin Russling.  Deriving a Class of Layer-Oriented Graph Algorithms , 1996, Sci. Comput. Program..