Regular Track に8本もグラフに関する論文が採択されているところを見ると、大規模グラフに関する研究が近年ますます盛んになっている証拠である。http://www.ipdps.org/ipdps2012/2012_advance_program.html
Fast and Efficient Graph Traversal Algorithm for CPUs : Maximizing Single-Node Efficiency
Jatin Chhugani (Intel Corporation, USA); Nadathur Satish (Intel Corporation, USA); Changkyu Kim (Intel Corporation, USA); Jason Sewall (Intel Corporation, USA); Pradeep Dubey (Intel Corporation, USA)
SAHAD: Subgraph Analysis in Massive Networks Using Hadoop
Zhao Zhao (Virginia Tech, USA); Guanying Wang (Virginia Tech, USA); Ali R Butt (Virginia Tech., USA); Maleq Khan (Virginia Tech, USA); Vullikanti S Anil Kumar (Virginia Tech, USA); Madhav Marathe (Virginia Tech, USA)
Accelerating nearest neighbor search on manycore systems
Lawrence Cayton (Max Planck Institute for Intelligent Systems, Germany)
Optimizing large-scale graph analysis on multithreaded, multicore platforms
Guojing Cong (IBM T.J. Watson Research Center, USA)
Multi-core spanning tree algorithms using the disjoint-set data structureFredrik Manne (University of Bergen, Norway); Md. Mostofa Ali Patwary (Northwestern University, USA); Peder Refsnes (University of Bergen, Norway)
Graph Partitioning for Reconfigurable TopologyDeepak Ajwani (University College Cork, Ireland); Shoukat Ali (Dublin Research Lab, IBM, USA); John P. Morrison (University Cork, Ireland)
Multithreaded Clustering for Multi-level Hypergraph PartitioningUmit V. Catalyurek (The Ohio State University, USA); Mehmet Deveci (The Ohio State University, USA); Kamer Kaya (The Ohio State University, USA); Bora Ucar (CNRS, France)
Multithreaded Algorithms for Maximum Matching in Bipartite GraphsAriful Azad (Purdue University, USA); Mahantesh Halappanavar (Pacific Northwest National Laboratory, USA); Sivasankaran Rajamanickam (Sandia National Laboratories, USA); Erik G. Boman (Sandia National Laboratories, USA); Arif Khan (Purdue University, USA); Alex Pothen (Purdue University, USA)
