Sciweavers

Share
1 search results - page 1 / 1
» aaim 2011
Sort
View
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
7 years 8 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
books