TY  - RPRT
A1  - Brunn, Thomas
A1  - Möller, Bernhard
A1  - Russling, Martin
T1  - Layered graph traversals and Hamiltonian path problems - an algebraic approach
N2  - 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 short path problem as well as topological sorting, cycle detection and finding maximum cardinality matchings.
T3  - Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg - 1997-08 
Y1  - 2006
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/266
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-2179
PB  - Institut für Informatik, Universität Augsburg
CY  - Augsburg
ER  -