1. IREK – AESM: Institutional Repository of Economic Knowledge
  2. Facultatea Cibernetică, Statistică şi Informatică Economică
  3. 2.Articole
Please use this identifier to cite or link to this item: https://irek.ase.md:443/xmlui/handle/1234567890/781
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPrisăcaru, Anatolie-
dc.date.accessioned2020-10-23T06:10:25Z-
dc.date.available2020-10-23T06:10:25Z-
dc.date.issued2018-09-
dc.identifier.isbn978-9975-75-934-2-
dc.identifier.uri${dspace.ui.url}/handle/1234567890/781-
dc.identifier.urihttp://irek.ase.md:80/xmlui/handle/1234567890/781-
dc.descriptionPRISĂCARU, Anatolie. Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf. In: Competitivitatea şi inovarea în economia cunoaşterii [online]: materiale/teze: conf. şt. intern., 28-29 sept. 2018. Chişinău: ASEM, 2018, pp. 53-54. E-ISBN 978-9975-75-934-2.en_US
dc.description.abstractThe problem of a graph covering with convex sets is investigated. It is shown that this problem may be reduced to a problem of a hipergraph colouring. JEL: C65en_US
dc.language.isootheren_US
dc.publisherASEMen_US
dc.subjectConvex seten_US
dc.subjectd-segmenten_US
dc.subjectgraphen_US
dc.subjecthypergraphen_US
dc.subjecthypergraph coloringen_US
dc.subjectIndependent seten_US
dc.subjectMetricen_US
dc.subjectsystem of cyclesen_US
dc.titleReducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergrafen_US
dc.typeArticleen_US
Appears in Collections:2.Articole

Files in This Item:
File Description SizeFormat 
Prisacaru_A_conf_09.18_teze.pdf419.09 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.