MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE

dc.contributor.authorBuzatu, Radu
dc.date.accessioned2018-02-26T13:00:16Z
dc.date.available2018-02-26T13:00:16Z
dc.date.issued2017
dc.description.abstractThe nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.en
dc.identifier.citationBUZATU, R. Maximum nontrivial convex cover of a tree. In: In: The Fourth Conference of Mathematical Society of the Republic of Moldova dedicated to the centenary of V. Andrunachievici (1917-1997): Proceeding CMSM4, June28-July2, 2017. Ch.: CEP USM, 2017, pp.365-368 ISBN 978-9975-71-915-5en
dc.identifier.isbn978-9975-71-915-5
dc.identifier.urihttps://msuir.usm.md/handle/123456789/1661
dc.language.isoenen
dc.publisherCEP USMen
dc.subjectconvexityen
dc.subjectnontrivial convex coveren
dc.subjecttreeen
dc.titleMAXIMUM NONTRIVIAL CONVEX COVER OF A TREEen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
365_368_Maximum nontrivial convex cover of a tree.pdf
Size:
620.49 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections