Alternating paths and cycles of minimum length

DOI10.1007/978-3-319-27261-0_32MaRDI QIDQ2959772zbMATH OpenOpenAlexFDO

Authors Giuseppe Liotta, W. Evans, Henk Meijer, S. Wismath

Publication date 10 February 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27261-0_32

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Alternating paths and cycles of minimum length
• Hamiltonian orthogeodesic alternating paths
• On Hamiltonian alternating cycles and paths
• Graph Drawing
• scientific article; zbMATH DE number 2145233

Cited in

(4)

• On Hamiltonian alternating cycles and paths
• On the length of longest alternating paths for multicoloured point sets in convex position
• Alternating paths and cycles of minimum length
• Long Alternating Paths Exist

This page was built for publication: Alternating paths and cycles of minimum length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959772)