On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity
Open access
Author
Date
2022Type
- Doctoral Thesis
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-b-000572947Publication status
publishedExternal links
Search print copy at ETH Library
Contributors
Examiner: Gärtner, Bernd
Examiner: Cardinal, Jean
Examiner: Mütze, Torsten
Examiner: Welzl, Emo
Publisher
ETH ZurichSubject
Pseudorandom walks; Reachability; Graph games; Switching systems; Gray code; exhaustive enumeration; Hamilton cycleOrganisational unit
08817 - Gärtner, Bernd (Tit.-Prof.) / Gärtner, Bernd (Tit.-Prof.)
More
Show all metadata
ETH Bibliography
yes
Altmetrics