Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
dc.citation.title | Electronic Notes in Discrete Mathematics | es |
dc.creator | Severín, Daniel Esteban | |
dc.date.accessioned | 2020-09-18T22:25:31Z | |
dc.date.available | 2020-09-18T22:25:31Z | |
dc.date.issued | 2018-08 | |
dc.description | In 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. | es |
dc.description.fil | Fil: Severín, Daniel. Universidad Nacional de Rosario. FCEIA. CONICET. Rosario; Argentina | es |
dc.format | application/pdf | |
dc.format.extent | 29–36 | es |
dc.identifier.issn | 1571-0653 | es |
dc.identifier.uri | http://hdl.handle.net/2133/18963 | |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation | info:eu-repo/semantics/dataset/hdl/2133/18962 | |
dc.relation | info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.005 | |
dc.relation.ispartofseries | http://hdl.handle.net/2133/18962 | es |
dc.relation.publisherversion | https://doi.org/10.1016/j.endm.2018.07.005 | es |
dc.rights | openAccess | es |
dc.rights.holder | © 2018 Elsevier B.V. All rights reserved | es |
dc.subject | Cross-identification | es |
dc.subject | Complexity | es |
dc.subject | Maximum Weighted Stable Set Problem | es |
dc.subject | Forbidden subgraphs | es |
dc.subject | http://biblio-int.mincyt.gob.ar/ford/1.3 | es |
dc.title | Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution | es |
dc.type | article | |
dc.type | artículo | |
dc.type | acceptedVersion | |
dc.type.collection | articulo | |
dc.type.version | acceptedVersion | es |