Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CC
2000
Springer

favoriteEmaildiscussreport

90views System Software» more CC 2000»

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

13 years 4 months ago

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Download web.maths.unsw.edu.au

Catherine S. Greenhill

Real-time Traffic

CC 2000 | System Software |

claim paper

Related Content

» The Complexity of Approximating BoundedDegree Boolean CSP

» Distance Oracles for Sparse Graphs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CC
Authors	Catherine S. Greenhill

Comments (0)