Mostra el registre d'ítem simple

dc.contributor.authorAichholzer, Oswin
dc.contributor.authorAurenhammer, Franz
dc.contributor.authorHackl, Thomas
dc.contributor.authorHuemer, Clemens
dc.contributor.authorPilz, Alexander
dc.contributor.authorVogtenhuber, Birgit
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2016-04-06T10:04:57Z
dc.date.available2016-12-06T01:30:58Z
dc.date.issued2015
dc.identifier.citationAichholzer, O., Aurenhammer, F., Hackl, T., Huemer, C., Pilz, A., Vogtenhuber, B. 3-colorability of pseudo-triangulations. "International journal of computational geometry and applications", 2015, vol. 25, núm. 4, p. 283-298.
dc.identifier.issn0218-1959
dc.identifier.urihttp://hdl.handle.net/2117/85279
dc.descriptionElectronic version of an article published as International Journal of Computational Geometry & Applications, Vol. 25, No. 4 (2015) 283–298 DOI: 10.1142/S0218195915500168 © 2015 World Scientific Publishing Company. http://www.worldscientific.com/worldscinet/ijcga
dc.description.abstractDeciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain families of graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations, which are a generalization of triangulations, and prove NP-completeness for this class. This result also holds if we bound their face degree to four, or exclusively consider pointed pseudo-triangulations with maximum face degree five. In contrast to these completeness results, we show that pointed pseudo-triangulations with maximum face degree four are always 3-colorable. An according 3-coloring can be found in linear time. Some complexity results relating to the rank of pseudo-triangulations are also given.
dc.format.extent16 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshGraph theory
dc.subject.otherpseudo-triangulation
dc.subject.other3-colorability
dc.subject.otherface degree
dc.title3-colorability of pseudo-triangulations
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.identifier.doi10.1142/S0218195915500168
dc.relation.publisherversionhttp://www.worldscientific.com/worldscinet/ijcga
dc.rights.accessOpen Access
local.identifier.drac17531745
dc.description.versionPostprint (author's final draft)
local.citation.authorAichholzer, O.; Aurenhammer, F.; Hackl, T.; Huemer, C.; Pilz, A.; Vogtenhuber, B.
local.citation.publicationNameInternational journal of computational geometry and applications
local.citation.volume25
local.citation.number4
local.citation.startingPage283
local.citation.endingPage298


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple