Sciweavers

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

34

Voted

CORR
2008
Springer

favoriteEmaildiscussreport

54views Education» more CORR 2008»

Finding Large Clique Minors is Hard

15 years 22 days ago

Finding Large Clique Minors is Hard

Download jgaa.info

David Eppstein

Real-time Traffic

CORR 2008 | Education |

claim paper

Related Content

» Large Maximal Cliques Enumeration in Large Sparse Graphs

» Finding maximal cliques in massive networks by Hgraph

» Bidimensionality and geometric graphs

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	David Eppstein

Comments (0)