Sciweavers

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

91

Voted

JCO
2007

82views more JCO 2007»

The densest k-subgraph problem on clique graphs

15 years 2 months ago

The densest k-subgraph problem on clique graphs

Download cgi.di.uoa.gr

Maria Liazi, Ioannis Milis, Fanny Pascual, Vassili

Real-time Traffic

JCO 2007 |

claim paper

Related Content

» Densest kSubgraph Approximation on Intersection Graphs

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Multiskill Collaborative Teams based on Densest Subgraphs

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCO
Authors	Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos

Comments (0)