Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution

dc.creatorSeverín, Daniel Esteban
dc.date2020-09-18T22:25:31Z
dc.date2020-09-18T22:25:31Z
dc.date2018-08
dc.date2020-09-18T22:25:31Z
dc.date2020-09-18T22:25:31Z
dc.date2018-08
dc.date.accessioned2022-10-14T19:58:31Z
dc.date.available2022-10-14T19:58:31Z
dc.identifier1571-0653
dc.identifierhttp://hdl.handle.net/2133/18963
dc.identifierhttp://hdl.handle.net/2133/18963
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4292582
dc.descriptionIn this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of such assignment is maximum. I show a way of modeling it as a Maximum Weighted Stable Set Problem which is further used to solve a real astronomical instance and I partially characterize the forbidden subgraphs of the resulting family of graphs given by that reduction. Finally, I prove that the problem is NP-Hard.
dc.descriptionFil: Severín, Daniel. Universidad Nacional de Rosario. FCEIA. CONICET. Rosario; Argentina
dc.formatapplication/pdf
dc.languageeng
dc.publisherElsevier
dc.relationhttp://hdl.handle.net/2133/18962
dc.relationhttps://doi.org/10.1016/j.endm.2018.07.005
dc.relationinfo:eu-repo/semantics/dataset/hdl/2133/18962
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.005
dc.rights© 2018 Elsevier B.V. All rights reserved
dc.rightsopenAccess
dc.subjectCross-identification
dc.subjectComplexity
dc.subjectMaximum Weighted Stable Set Problem
dc.subjectForbidden subgraphs
dc.subjecthttp://biblio-int.mincyt.gob.ar/ford/1.3
dc.titleCross-identification of stellar catalogs with multiple stars: Complexity and Resolution
dc.typearticle
dc.typeartículo
dc.typeacceptedVersion


Este ítem pertenece a la siguiente institución