Simple Paths and Cycles Avoiding Forbidden Paths

DOI10.1007/978-3-319-73117-9_20zbMath1445.68172OpenAlexW2779747908MaRDI QIDQ5127183

Benjamin Momège

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73117-9_20

zbMATH Keywords

Hamiltonian cyclesgraph algorithmsexact algorithmsexponential-time algorithmsforbidden paths

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: Simple Paths and Cycles Avoiding Forbidden Paths