Publication: Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
ASEM
Abstract
Description
PRISĂ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.
The 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: C65
The 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: C65
Keywords
Convex set, d-segment, graph, hypergraph, hypergraph coloring, Independent set, Metric, system of cycles