Hamiltonian Orthogeodesic Alternating Paths

DOI10.1007/978-3-642-25011-8_14zbMath1314.68345OpenAlexW1973678753WikidataQ62042496 ScholiaQ62042496MaRDI QIDQ3111649

Giuseppe Liotta, Luca Grilli, Emilio Di Giacomo, Ignaz Rutter, Marcus Krug

Publication date: 13 January 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_14

Mathematics Subject Classification ID

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 (2)

Bend-optimal orthogonal graph drawing in the general position model ⋮ Orthogeodesic Point-Set Embedding of Trees

This page was built for publication: Hamiltonian Orthogeodesic Alternating Paths