Article Comments

Contributions from readers on our articles are very welcome. This form will let us retrieve the current data in the database and allows us to consider your comments.

A deterministic approximation algorithm for the Densest k-Subgraph Problem
Frederic Roupin, Alain Billionnet
International Journal of Operational Research (IJOR), 2008 Vol.3 No.3, pp.301 - 314
20 - 5 =

Thank you for your feedback.

Return to top