U. A. Acar, G. E. Blelloch, and R. D. Blumofe, The data locality of work stealing, Theory of Computing Systems (TOCS), pp.321-347, 2002.

U. A. Acar, A. Charguéraud, and M. Rainey, Oracle scheduling: Controlling granularity in implicitly parallel languages, ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2011.
URL : https://hal.archives-ouvertes.fr/hal-01409069

U. A. Acar, A. Charguéraud, and M. Rainey, Scheduling parallel programs by work stealing with private deques, PPoPP '13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00863028

U. A. Acar, A. Charguéraud, and M. Rainey, Theory and Practice of Chunked Sequences, ESA 2014, pp.25-36, 2014.
DOI : 10.1007/978-3-662-44777-2_3
URL : https://hal.archives-ouvertes.fr/hal-01087245

V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, Scalable Graph Exploration on Multicore Processors, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-11, 2010.
DOI : 10.1109/SC.2010.46

A. Aggarwal, R. J. Anderson, and M. Kao, Parallel Depth-First Search in General Directed Graphs, SIAM Journal on Computing, vol.19, issue.2, pp.397-409, 1990.
DOI : 10.1137/0219025

D. A. Bader and K. Madduri, Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2, 2006 International Conference on Parallel Processing (ICPP'06), pp.523-530, 2006.
DOI : 10.1109/ICPP.2006.34

S. Beamer, K. Asanovi´casanovi´c, and D. Patterson, Direction-optimizing breadth-first search, SC '12, pp.1-1210, 2012.

R. Berrendorf and M. Makulla, Level-synchronous parallel breadth-first search algorithms for multicore and multiprocessor systems, FC '14, pp.26-31, 2014.

G. E. Blelloch, P. Cheng, and P. B. Gibbons, Room synchronizations, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.122-133, 2001.
DOI : 10.1145/378580.378605

G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and J. Shun, Internally deterministic parallel algorithms can be fast, PPoPP '12, pp.181-192, 2012.

R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM, vol.46, issue.5, pp.720-748, 1999.
DOI : 10.1145/324133.324234

D. Chakrabarti, Y. Zhan, and C. Faloutsos, R-MAT: A Recursive Model for Graph Mining, SIAM SDM, 2004.
DOI : 10.1137/1.9781611972740.43

D. Chase and Y. Lev, Dynamic circular work-stealing deque, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.21-28, 2005.
DOI : 10.1145/1073970.1073974

C. Cher, A. L. Hosking, and T. Vijaykumar, Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign, ASPLOS '04, pp.199-210, 2004.

J. Chhugani, N. Satish, C. Kim, J. Sewall, and P. Dubey, Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.378-389, 2012.
DOI : 10.1109/IPDPS.2012.43

G. Cong, S. B. Kodali, S. Krishnamoorthy, D. Lea, V. A. Saraswat et al., Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing, 2008 37th International Conference on Parallel Processing, pp.536-545, 2008.
DOI : 10.1109/ICPP.2008.88

T. A. Davis, University of florida sparse matrix collection Available at http://www.cise.ufl, 2010.

T. Endo, K. Taura, and A. Yonezawa, A scalable mark-sweep garbage collector on large-scale shared-memory machines, Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '97, pp.48-48, 1997.
DOI : 10.1145/509593.509641

C. H. Flood, D. Detlefs, N. Shavit, and X. Zhang, Parallel garbage collection for shared memory multiprocessors, JVM '01, 2001.

T. Hagerup, Planar Depth-First Search in $O(\log n)$ Parallel Time, SIAM Journal on Computing, vol.19, issue.4, pp.678-704, 1990.
DOI : 10.1137/0219047

A. Harshvardhan, N. M. Fidel, L. Amato, and . Rauchwerger, KLA, Proceedings of the 23rd international conference on Parallel architectures and compilation, PACT '14, pp.27-38, 2014.
DOI : 10.1145/2628071.2628091

D. Hendler and N. Shavit, Non-blocking steal-half work queues, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.280-289, 2002.
DOI : 10.1145/571825.571876

X. Huang, S. M. Blackburn, K. S. Mckinley, J. E. Moss, Z. Wang et al., The garbage collection advantage: improving program locality, Proceedings of the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp.69-80, 2004.

. Intel, Cilk Plus

R. Jones, A. Hosking, and E. Moss, The garbage collection handbook: the art of automatic memory management, 2011.
DOI : 10.1201/9781315388021

V. Kumar and V. Rao, Parallel depth first search. Part II. Analysis, International Journal of Parallel Programming, vol.9, issue.2, pp.501-519, 1987.
DOI : 10.1007/BF01389001

H. Kwak, C. Lee, H. Park, and S. Moon, What is Twitter, a social network or a news media?, Proceedings of the 19th international conference on World wide web, WWW '10, pp.591-600, 2010.
DOI : 10.1145/1772690.1772751

C. E. Leiserson and T. B. Schardl, A work-efficient parallel breadth-first search algorithm, SPAA '10, pp.303-314, 2010.

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement , IMC '07, pp.29-42, 2007.
DOI : 10.1145/1298306.1298311

D. Mizell and K. J. Maschhoff, Early experiences with large-scale Cray XMT systems, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-9, 2009.
DOI : 10.1109/IPDPS.2009.5161108

D. Nguyen, A. Lenharth, and K. Pingali, A lightweight infrastructure for graph analytics, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP '13, pp.456-471, 2013.
DOI : 10.1145/2517349.2522739

M. Patwary, P. Refsnes, and F. Manne, Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.827-835, 2012.
DOI : 10.1109/IPDPS.2012.79

M. J. Quinn and N. Deo, Parallel graph algorithms, ACM Computing Surveys, vol.16, issue.3, pp.319-348, 1984.
DOI : 10.1145/2514.2515

V. Rao and V. Kumar, Parallel depth first search. Part I. Implementation, International Journal of Parallel Programming, vol.29, issue.1, pp.479-499, 1987.
DOI : 10.1007/BF01389000

E. Reghbati and D. G. , Parallel Computations in Graph Theory, SIAM Journal on Computing, vol.7, issue.2, pp.230-237, 1978.
DOI : 10.1137/0207020

E. Reghbati, Arjomandi) and D. Corneil. Parallel computations in graph theory, SIAM JoC, vol.7, issue.2, pp.230-237, 1978.

J. H. Reif, Depth-first search is inherently sequential, Information Processing Letters, vol.20, issue.5, pp.229-234, 1985.
DOI : 10.1016/0020-0190(85)90024-9

V. A. Saraswat, P. Kambadur, S. B. Kodali, D. Grove, and S. Krishnamoorthy, Lifeline-based global load balancing, PPOPP, pp.201-212, 2011.

A. E. Sariyüce, K. Kaya, E. Saule, and U. V. Çatalyürek, Betweenness centrality on GPUs and heterogeneous architectures, Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, GPGPU-6, pp.76-85, 2013.
DOI : 10.1145/2458523.2458531

E. Saule and Ü. V. Çatalyürek, An Early Evaluation of the Scalability of Graph Algorithms on the Intel MIC Architecture, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp.1629-1639, 2012.
DOI : 10.1109/IPDPSW.2012.204

J. Shun and G. E. Blelloch, Ligra: a lightweight graph processing framework for shared memory, PPOPP '13, pp.135-146, 2013.

J. Shun, L. Dhulipala, and G. Blelloch, A simple and practical linear-work parallel algorithm for connectivity, Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, SPAA '14, pp.143-153, 2014.
DOI : 10.1145/2612669.2612692

F. Siebert, Concurrent, parallel, real-time garbage-collection, Proceedings of the 2010 international symposium on Memory management, ISMM '10, pp.11-20, 2010.
DOI : 10.1145/1806651.1806654

A. Tzannes, G. C. Caragea, U. Vishkin, and R. Barua, Lazy Scheduling, ACM Transactions on Programming Languages and Systems, vol.36, issue.3, pp.1-1051, 2014.
DOI : 10.1145/2629643

C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao, User interactions in social networks and their implications, Proceedings of the fourth ACM european conference on Computer systems, EuroSys '09, pp.205-218, 2009.
DOI : 10.1145/1519065.1519089

Y. Xia and V. K. Prasanna, Topologically adaptive parallel breadth-first search on multicore processors, IASTED '09, p.91, 2009.