11 search results - page 1 / 3 » Star forests, dominating sets and Ramsey-type problems |
122
Voted
APPROX
2007
Springer
15 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 ...
148
Voted
DM
2002
15 years 3 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...
295
click to vote
AAIM
2011
Springer
14 years 7 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 ...
157
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
148
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
A Spatio-Temporal Association Rule (STAR) describes how objects move between regions over time. Since they describe only a single movement between two regions, it is very difficu...