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 short path problem as well as topological sorting, cycle detection and finding maximum cardinality matchings.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Thomas Brunn, Bernhard MöllerGND, Martin Russling
Frontdoor URL
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (1997-08)
Publisher:Institut für Informatik, Universität Augsburg
Place of publication:Augsburg
Year of first Publication:1997
Publishing Institution:Universität Augsburg
Release Date:2006/06/20
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik