Appendix and source code of ACP solver for the paper On the additive chromatic number of several families of graphs

DSpace/Manakin Repository

Show simple item record

dc.creator Severín, Daniel Esteban
dc.date.accessioned 2020-09-21T19:47:39Z
dc.date.available 2020-09-21T19:47:39Z
dc.date.issued 2020-02-12
dc.identifier.uri http://hdl.handle.net/2133/18976
dc.description This folder contains a source code for solving the ADDITIVE COLORING PROBLEM as well as testing the ADDITIVE COLORING CONJECTURE. In addition, it contains the appendix of the paper "On the additive chromatic number of several families of graphs" with proofs of some propositions, the integer programming model and some computational experiments. es
dc.description Steps to reproduce The programs ACOPT, TEST and DSATUR should be compiled with Visual Studio 2013. The programs also require IBM ILOG CPLEX 12.6. Below, some examples are given. Testing the additive coloring conjecture on all graphs of 4 vertices: test.exe graphs4.all Recall that acopt.exe and dsatur.exe must be present in the same folder. Also, acopt must be compiled without "VERBOSE" definition (just comment that line in source code). Since "test" generates several files on-the-fly and makes heavy use of the hard disk, it is advisable to execute it on a RamDisk. Obtaining the additive chromatic number of a graph, e.g. the cycle sun with m = 10, and assuming an upper bound UB = 8: acopt.exe CS10.graph 8 If none upper bound is provided, it uses UB = Delta(G)^2-Delta(G)+1 by default (which is really bad!). A lower bound LB can also be provided together with UB. For example: acopt.exe KS10.graph 10 4 In particular, for obtaining an additive k-coloring for a specific k, use UB = LB = k. It is recommended to compile acopt with "VERBOSE" definition for viewing log and optimal solution. es
dc.description.sponsorship This work was partially supported by grants PID-ING 416 (UNR), PICT-2013-0586 (MINCyT) and PIP 11220120100277 (CONICET) es
dc.format application/octet-stream
dc.format application/pdf
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.format application/octet-stream
dc.language.iso eng es
dc.relation info:eu-repo/semantics/altIdentifier/doi/10.17632/9zwm2nxvbs.1
dc.rights openAccess es
dc.rights.uri https://creativecommons.org/licenses/by/4.0/ *
dc.subject Additive chromatic number es
dc.subject Additive coloring conjecture es
dc.subject Lucky labeling es
dc.subject Graph algorithms es
dc.subject https://purl.org/becyt/ford/1.1 es
dc.subject Integer Programming es
dc.title Appendix and source code of ACP solver for the paper On the additive chromatic number of several families of graphs es
dc.type other
dc.type conjunto de datos
dc.type publishedVersion
dc.rights.holder Autor es
dc.relation.publisherversion https://doi.org/10.1016/j.ipl.2020.105937 es
dc.rights.text https://creativecommons.org/licenses/by/4.0/ es
dc.citation.title Severin, Daniel (2020), “Appendix and source code of ACP solver for the paper On the additive chromatic number of several families of graphs”, Mendeley Data, V1, doi: 10.17632/9zwm2nxvbs.1 http://dx.doi.org/10.17632/9zwm2nxvbs.1
dc.description.fil Fil: Severín, Daniel. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura. Rosario; Argentina es


Files in this item

This item appears in the following Collection(s)

Show simple item record

openAccess Except where otherwise noted, this item's license is described as openAccess

My Account


Search DSpace


Advanced Search

Browse

Statistics