Hamiltonian orthogeodesic alternating paths
DOI10.1016/j.jda.2012.04.012zbMath1255.68188OpenAlexW2175666350WikidataQ62042457 ScholiaQ62042457MaRDI QIDQ1932349
Luca Grilli, Giuseppe Liotta, Marcus Krug, Ignaz Rutter, Emilio Di Giacomo
Publication date: 18 January 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.012
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorial complexity of geometric structures (52C45)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Simple alternating path problem
- Long alternating paths in bicolored point sets
- Bipartite embeddings of trees in the plane
- On the length of longest alternating paths for multicoloured point sets in convex position
- Manhattan-Geodesic Embedding of Planar Graphs
- Hamiltonian Alternating Paths on Bicolored Double-Chains
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
This page was built for publication: Hamiltonian orthogeodesic alternating paths