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

Please use this identifier to cite or link to this item: https://irek.ase.md:443/xmlui/handle/1234567890/781

Title:	Reducerea problemei de acoperire a unui graf cu mulţimi convexe la problema de colorare a unui hipergraf
Authors:	Prisăcaru, Anatolie
Keywords:	Convex set d-segment graph hypergraph hypergraph coloring Independent set Metric system of cycles
Issue Date:	Sep-2018
Publisher:	ASEM
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
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.
URI:	${dspace.ui.url}/handle/1234567890/781 http://irek.ase.md:80/xmlui/handle/1234567890/781
ISBN:	978-9975-75-934-2
Appears in Collections:	2.Articole

Files in This Item:

File	Description	Size	Format
Prisacaru_A_conf_09.18_teze.pdf		419.09 kB	Adobe PDF	View/Open

DSpace JSPUI