Graph (abstract data type) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph (abstract data type)" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

1,624^th place

1,592^nd place

451^st place

277^th place

5^th place

5^th place

274^th place

309^th place

1web.archive.org

1^st place

1^st place

1graphengine.io

low place

low place

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

69^th place

59^th place

low place

low place

ams.org (Global: 451^st place; English: 277^th place)

Bader, David; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (January 2013). Graph Partitioning and Graph Clustering. Contemporary Mathematics. Vol. 588. American Mathematical Society. doi:10.1090/conm/588/11709. ISBN 978-0-8218-9038-7.

arxiv.org (Global: 69^th place; English: 59^th place)

Besta, Maciej; Hoefler, Torsten (27 April 2019). "Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations". arXiv:1806.01799 [cs.DS].

doi.org (Global: 2^nd place; English: 2^nd place)

Bader, David; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (January 2013). Graph Partitioning and Graph Clustering. Contemporary Mathematics. Vol. 588. American Mathematical Society. doi:10.1090/conm/588/11709. ISBN 978-0-8218-9038-7.
Lumsdaine, Andrew; Gregor, Douglas; Hendrickson, Bruce; Berry, Jonathan (March 2007). "Challenges in Parallel Graph Processing". Parallel Processing Letters. 17 (1): 5–20. doi:10.1142/s0129626407002843. ISSN 0129-6264.
Buluç, A.; Madduri, Kamesh (2011). "Applications". Parallel breadth-first search on distributed memory systems. 2011 International Conference for High Performance Computing, Networking, Storage and Analysis. CiteSeerX 10.1.1.767.5248. doi:10.1145/2063384.2063471. ISBN 978-1-4503-0771-0. S2CID 6540738.

graphengine.io (Global: low place; English: low place)

"Parallel Processing of Graphs" (PDF). Archived from the original (PDF) on 2021-08-25. Retrieved 2020-03-09.

ijrar.com (Global: low place; English: low place)

Purti (July–September 2018). "Graph Traversals and its Applications" (PDF). International Journal of Research and Analytical Reviews. 5 (3): 2.

mpg.de (Global: 1,624^th place; English: 1,592^nd place)

people.mpi-inf.mpg.de

See, e.g. Goodrich & Tamassia (2015), Section 13.1.2: Operations on graphs, p. 360. For a more detailed set of operations, see Mehlhorn, K.; Näher, S. (1999). "Chapter 6: Graphs and their data structures". LEDA: A platform for combinatorial and geometric computing (PDF). Cambridge University Press. pp. 240–282.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Buluç, A.; Madduri, Kamesh (2011). "Applications". Parallel breadth-first search on distributed memory systems. 2011 International Conference for High Performance Computing, Networking, Storage and Analysis. CiteSeerX 10.1.1.767.5248. doi:10.1145/2063384.2063471. ISBN 978-1-4503-0771-0. S2CID 6540738.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Buluç, A.; Madduri, Kamesh (2011). "Applications". Parallel breadth-first search on distributed memory systems. 2011 International Conference for High Performance Computing, Networking, Storage and Analysis. CiteSeerX 10.1.1.767.5248. doi:10.1145/2063384.2063471. ISBN 978-1-4503-0771-0. S2CID 6540738.

springer.com (Global: 274^th place; English: 309^th place)

Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman (2019). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer International Publishing. ISBN 978-3-030-25208-3.

web.archive.org (Global: 1^st place; English: 1^st place)

"Parallel Processing of Graphs" (PDF). Archived from the original (PDF) on 2021-08-25. Retrieved 2020-03-09.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Lumsdaine, Andrew; Gregor, Douglas; Hendrickson, Bruce; Berry, Jonathan (March 2007). "Challenges in Parallel Graph Processing". Parallel Processing Letters. 17 (1): 5–20. doi:10.1142/s0129626407002843. ISSN 0129-6264.