Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf

dc.contributor.author	Prisăcaru, Anatolie
dc.date.accessioned	2020-10-23T06:10:25Z
dc.date.available	2020-10-23T06:10:25Z
dc.date.issued	2018-09
dc.identifier.isbn	978-9975-75-934-2
dc.identifier.uri	${dspace.ui.url}/handle/1234567890/781
dc.identifier.uri	http://irek.ase.md:80/xmlui/handle/1234567890/781
dc.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.	en_US
dc.description.abstract	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	en_US
dc.language.iso	other	en_US
dc.publisher	ASEM	en_US
dc.subject	Convex set	en_US
dc.subject	d-segment	en_US
dc.subject	graph	en_US
dc.subject	hypergraph	en_US
dc.subject	hypergraph coloring	en_US
dc.subject	Independent set	en_US
dc.subject	Metric	en_US
dc.subject	system of cycles	en_US
dc.title	Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf	en_US
dc.type	Article	en_US