Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The alternating path problem revisited

Autor
Claverol, M.; Garijo, D.; Hurtado, F.; Lara, M.; Seara, C.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
XV Spanish Meeting on Computational Geometry
Any de l'edició
2013
Data de presentació
2013-06-28
Llibre d'actes
XV Spanish Meeting on Computational Geometry
Pàgina inicial
115
Pàgina final
118
Editor
Universidad de Sevilla
Repositori
http://hdl.handle.net/2117/21369 Obrir en finestra nova
Resum
It is well known that, given "n" red points and "n" blue points on acircle, it is not always possible to find a plane geometric. Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path from being plane to being 1-plane, then the problem always has a solution, and even a Hamiltonian alternating cycle can be obtained on all instances. we also extend this kind of result to other configurations and provide remarks on similar problems. It is well known that, gi...
Citació
Claverol, M. [et al.]. The alternating path problem revisited. A: Spanish Meeting on Computational Geometry. "XV Spanish Meeting on Computational Geometry". Sevilla: Universidad de Sevilla, 2013, p. 115-118.
Grup de recerca
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants

  • Claverol Aguas, Merce  (autor ponent)
  • Garijo Royo, Delia  (autor ponent)
  • Hurtado Diaz, Fernando Alfredo  (autor ponent)
  • Lara Cuevas, Maria Dolores  (autor ponent)
  • Seara Ojea, Carlos  (autor ponent)

Arxius