Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
AAIM
2011
Springer
2011
Springer
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 a spanning subgraph of G that is also a star forest. The spanning star forest problem (SSF for short) [14] is to find the maximum-size spanning star forest of a given graph. In this paper, we study several variants of SSF, obtaining first or improved approximation and hardness results in all settings as shown below.
Real-time TrafficAAIM 2011 | Algorithms | Maximum Size | Ssf | Star Forest |
| Added | 23 Aug 2011 |
| Updated | 23 Aug 2011 |
| Type | Journal |
| Year | 2011 |
| Where | AAIM |
| Authors | Jing He, Hongyu Liang |
Comments (0)
Researcher Info
|
