MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE
Login
DSpace Home
→
Facultatea de Matematică şi Informatică
→
2. Articole
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE
Buzatu, Radu
URI:
http://dspace.usm.md:8080/xmlui/handle/123456789/1661
Date:
2017
Abstract:
The 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.
Show full item record
Files in this item
Name:
365_368_Maximum ...
Size:
620.4Kb
Format:
PDF
View/
Open
This item appears in the following Collection(s)
2. Articole
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register