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

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

cris.sourceId	oai:irek.ase.md:1234567890/781
dc.creator	Prisăcaru, Anatolie
dc.date	2020-10-23T06:10:25Z
dc.date	2020-10-23T06:10:25Z
dc.date	2018-09
dc.date.accessioned	2023-11-13T10:00:33Z
dc.date.available	2023-11-13T10:00:33Z
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.
dc.description	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
dc.format	application/pdf
dc.identifier	978-9975-75-934-2
dc.identifier	${dspace.ui.url}/handle/1234567890/781
dc.identifier	http://irek.ase.md:80/xmlui/handle/1234567890/781
dc.identifier.uri	https://cris.ase.md/handle/123456789/842
dc.language	other
dc.publisher	ASEM
dc.subject	Convex set
dc.subject	d-segment
dc.subject	graph
dc.subject	hypergraph
dc.subject	hypergraph coloring
dc.subject	Independent set
dc.subject	Metric
dc.subject	system of cycles
dc.title	Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf
dc.type	Article
dspace.entity.type	Publication

Now showing 1 - 1 of 1