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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
45
click to vote
GC
2011
Springer
favorite
Email
discuss
report
210
views
Applied Computing
»
more
GC 2011
»
The Number of Independent Sets in a Graph with Small Maximum Degree
13 years 5 months ago
Download
www.nd.edu
David Galvin, Yufei Zhao
Real-time Traffic
Applied Computing
|
GC 2011
|
claim paper
Related Content
»
The independence number in graphs of maximum degree three
»
Approximation Algorithms for the Weighted Independent Set Problem
»
Improved Approximations of Independent Sets in BoundedDegree Graphs
»
PTAS for maximum weight independent set problem with random weights in bounded degree grap...
»
On the practical complexity of solving the maximum weighted independent set problem for op...
»
On Constant Time Approximation of Parameters of Bounded Degree Graphs
»
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets i...
»
Finding Independent Sets in Unions of Perfect Graphs
»
Using critical sets to solve the maximum independent set problem
more »
Post Info
More Details (n/a)
Added
14 May 2011
Updated
14 May 2011
Type
Journal
Year
2011
Where
GC
Authors
David Galvin, Yufei Zhao
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision