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

Autores
Severin, Daniel Esteban
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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 N P-Hard.
Fil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario; Argentina
Materia
COMPLEXITY
CROSS-IDENTIFICATION
FORBIDDEN SUBGRAPHS
MAXIMUM WEIGHTED STABLE SET PROBLEM
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/100735
Acceder
id CONICETDig_dee23560a4f832ae2576ec366494e3b7
oai_identifier_str oai:ri.conicet.gov.ar:11336/100735
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Cross-identification of stellar catalogs with multiple stars: Complexity and ResolutionSeverin, Daniel EstebanCOMPLEXITYCROSS-IDENTIFICATIONFORBIDDEN SUBGRAPHSMAXIMUM WEIGHTED STABLE SET PROBLEMhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In 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 N P-Hard.Fil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario; ArgentinaElsevier2018-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/100735Severin, Daniel Esteban; Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution; Elsevier; Electronic Notes in Discrete Mathematics; 69; 8-2018; 29-361571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.005info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S1571065318301483info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:07:03Zoai:ri.conicet.gov.ar:11336/100735instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:07:03.6CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
spellingShingle Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
Severin, Daniel Esteban
COMPLEXITY
CROSS-IDENTIFICATION
FORBIDDEN SUBGRAPHS
MAXIMUM WEIGHTED STABLE SET PROBLEM
title_short Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_full Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_fullStr Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_full_unstemmed Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
title_sort Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
dc.creator.none.fl_str_mv Severin, Daniel Esteban
author Severin, Daniel Esteban
author_facet Severin, Daniel Esteban
author_role author
dc.subject.none.fl_str_mv COMPLEXITY
CROSS-IDENTIFICATION
FORBIDDEN SUBGRAPHS
MAXIMUM WEIGHTED STABLE SET PROBLEM
topic COMPLEXITY
CROSS-IDENTIFICATION
FORBIDDEN SUBGRAPHS
MAXIMUM WEIGHTED STABLE SET PROBLEM
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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 N P-Hard.
Fil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario; Argentina
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 N P-Hard.
publishDate 2018
dc.date.none.fl_str_mv 2018-08
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/100735
Severin, Daniel Esteban; Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution; Elsevier; Electronic Notes in Discrete Mathematics; 69; 8-2018; 29-36
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/100735
identifier_str_mv Severin, Daniel Esteban; Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution; Elsevier; Electronic Notes in Discrete Mathematics; 69; 8-2018; 29-36
1571-0653
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.005
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S1571065318301483
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844613926455607296
score 13.070432

Publicaciones similares