Problema di copertura dei vertici (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema di copertura dei vertici" in Italian language version.

refsWebsite

Global rank Italian rank

1^st place

1,185^th place

1,964^th place

799^th place

22^nd place

2^nd place

7^th place

6,572^nd place

low place

3,903^rd place

low place

acm.org

M. R. Garey, D. S. Johnson e L. Stockmeyer, Some simplified NP-complete problems, in Proceedings of the sixth annual ACM symposium on Theory of computing, 1974, 47–63.

I. Dinur and S. Safra. On the Hardness of Approximating Minimum Vertex-Cover Archiviato il 20 settembre 2009 in Internet Archive.. Annals of Mathematics, 162(1):439-485, 2005. (Preliminary version in STOC 2002, titled "On the Importance of Being Biased").

Flum, J., Grohe, M., Parameterized Complexity Theory, Springer, 2006, ISBN 978-3-540-29952-3. URL consultato il 3 maggio 2019 (archiviato dall'url originale il 18 novembre 2007).
I. Dinur and S. Safra. On the Hardness of Approximating Minimum Vertex-Cover Archiviato il 20 settembre 2009 in Internet Archive.. Annals of Mathematics, 162(1):439-485, 2005. (Preliminary version in STOC 2002, titled "On the Importance of Being Biased").