مجموعه گره‌های بازخورد (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "مجموعه گره‌های بازخورد" in Persian language version.

refsWebsite

Global rank Persian rank

2web.archive.org

1^st place

1^st place

2^nd place

2^nd place

3,903^rd place

3,695^th place

580^th place

676^th place

berkeley.edu

cs.berkeley.edu

(Karp 1972) Karp, Richard M. (1972), "Reducibility Among Combinatorial Problems", Complexity of Computer Computations, Proc. Sympos. IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y.. New York: Plenum (PDF), pp. 85–103, archived from the original (PDF) on 29 June 2011, retrieved 12 July 2012

doi.org

(Dinur و Safra 2005) Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics, 162 (1): 439–485, doi:10.4007/annals.2005.162.439, archived from the original (PDF) on 20 September 2009, retrieved 2010-03-05.

huji.ac.il

cs.huji.ac.il

(Dinur و Safra 2005) Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics, 162 (1): 439–485, doi:10.4007/annals.2005.162.439, archived from the original (PDF) on 20 September 2009, retrieved 2010-03-05.

web.archive.org

(Dinur و Safra 2005) Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics, 162 (1): 439–485, doi:10.4007/annals.2005.162.439, archived from the original (PDF) on 20 September 2009, retrieved 2010-03-05.
(Karp 1972) Karp, Richard M. (1972), "Reducibility Among Combinatorial Problems", Complexity of Computer Computations, Proc. Sympos. IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y.. New York: Plenum (PDF), pp. 85–103, archived from the original (PDF) on 29 June 2011, retrieved 12 July 2012