Covering graphs with convex sets and partitioning graphs into convex sets

dc.creatorGonzález, Lucía M.
dc.creatorGrippo, Luciano Norberto
dc.creatorSafe, Martin Dario
dc.creatorFernandes Dos Santos, Vinicius
dc.date.accessioned2022-09-19T17:56:23Z
dc.date.accessioned2022-10-14T22:01:41Z
dc.date.available2022-09-19T17:56:23Z
dc.date.available2022-10-14T22:01:41Z
dc.date.created2022-09-19T17:56:23Z
dc.date.issued2020-06
dc.identifierGonzález, Lucía M.; Grippo, Luciano Norberto; Safe, Martin Dario; Fernandes Dos Santos, Vinicius; Covering graphs with convex sets and partitioning graphs into convex sets; Elsevier Science; Information Processing Letters; 158; 105944; 6-2020; 1-5
dc.identifier0020-0190
dc.identifierhttp://hdl.handle.net/11336/169356
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4311624
dc.description.abstractWe present some complexity results concerning the problems of covering a graph with p convex sets and of partitioning a graph into p convex sets. The following convexities are considered: digital convexity, monophonic convexity, P3-convexity, and P3 ⁎-convexity.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0020019020300314
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.ipl.2020.105944
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectCOMPUTATIONAL COMPLEXITY
dc.subjectCONVEX P-COVER
dc.subjectCONVEX P-PARTITION
dc.titleCovering graphs with convex sets and partitioning graphs into convex sets
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución