To access the full text documents, please follow this link: http://hdl.handle.net/2117/112128
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.contributor.author | Claverol Aguas, Mercè |
dc.contributor.author | García, Alfredo |
dc.contributor.author | Garijo Royo, Delia |
dc.contributor.author | Seara Ojea, Carlos |
dc.contributor.author | Tejel, Javier |
dc.date | 2018-03 |
dc.identifier.citation | Claverol, M., García, A., Garijo, D., Seara, C., Tejel, J. On Hamiltonian alternating cycles and paths. "Computational geometry: theory and applications", Març 2018, vol. 68, p. 146-166. |
dc.identifier.citation | 0925-7721 |
dc.identifier.citation | 10.1016/j.comgeo.2017.05.009 |
dc.identifier.uri | http://hdl.handle.net/2117/112128 |
dc.language.iso | eng |
dc.relation | http://www.sciencedirect.com/science/article/pii/S0925772117300421?via%3Dihub |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject | Algorithms |
dc.subject | Bicolored point sets |
dc.subject | Hamiltonian alternating cycles and paths |
dc.subject | 1-plane graphs |
dc.subject | Minimum number of crossings |
dc.subject | Algorismes |
dc.subject | Classificació AMS::68 Computer science::68W Algorithms |
dc.title | On Hamiltonian alternating cycles and paths |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract | |
dc.description.abstract |