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.
Download full text files
Postprint
Statistics
Additional Services
| Author: | Thomas Brunn, Bernhard MöllerGND, Martin Russling |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-262236 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/26223 |
| ISSN: | 0302-9743OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 1998 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2017/07/21 |
| Volume: | 1422 |
| First Page: | 96 |
| Last Page: | 121 |
| DOI: | https://doi.org/10.1007/BFb0054287 |
| 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 |
| Licence (German): |  Deutsches Urheberrecht |
