AAIM
2011
Springer
12 years 8 months ago
2011
Springer
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 ...
DM
2002
13 years 4 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
APPROX
2007
Springer
13 years 10 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...