Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1
search results - page 1 / 1
»
aaim 2011
Sort
relevance
views
votes
recent
update
View
thumb
title
89
click to vote
AAIM
2011
Springer
337
views
Algorithms
»
more
AAIM 2011
»
On Variants of the Spanning Star Forest Problem
13 years 2 months ago
Download
itcs.tsinghua.edu.cn
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
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »