TY  - JOUR
A1  - Brunn, Thomas
A1  - Möller, Bernhard
A1  - Russling, Martin
T1  - Layered graph traversals and Hamiltonian path problems — an algebraic approach
T2  - Lecture Notes in Computer Science
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 shortest path problem as well as topological sorting and finding maximum cardinality matchings.
Y1  - 1998
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/26223
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-262236
SN  - 0302-9743
VL  - 1422
SP  - 96
EP  - 121
PB  - Springer
ER  -