• SNAP

  • Referenced in 171 articles [sw04184]
  • maximum performance and compact graph representation. It easily scales to massive networks with hundreds ... billions of edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random...
  • ANF

  • Referenced in 14 articles [sw12276]
  • scalable tool for data mining in massive graphs. Graphs are an increasingly important data source...
  • DOULION

  • Referenced in 12 articles [sw30192]
  • DOULION: counting triangles in massive graphs with a coin. Counting the number of triangles...
  • BBMCSP

  • Referenced in 10 articles [sw17718]
  • maximum clique algorithm for large and massive sparse graphs. This paper describes a new very ... algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently in real life...
  • gpuls-mwcp

  • Referenced in 5 articles [sw41468]
  • maximum weight clique problem on massive graphs. Given an undirected graph with positive weights ... heuristic for solving the MWCP on massive graphs. The heuristic is based ... mapped onto a GPU-based massively parallel architecture. We test ... proposed heuristic on real-world massive graphs with millions of edges and vertices. The results...
  • SCCWalk

  • Referenced in 4 articles [sw32102]
  • Moreover, to improve the performance on massive graphs, we apply a low-complexity heuristic called ... rules to decrease the scale of massive graphs. We carry out experiments to evaluate ... from clustering aggregation, as well as massive graphs, including a suite of massive real-world ... obtain the best solutions for most massive graphs...
  • Rigel

  • Referenced in 2 articles [sw40556]
  • Fast and Scalable Analysis of Massive Social Graphs. Graph analysis is a critical component ... Internet traffic analysis. The arrival of massive graphs with hundreds of millions of nodes ... scalable graph processing on today’s massive graphs. We explore the design space of graph...
  • GossipMap

  • Referenced in 2 articles [sw41758]
  • properties predicted by analysis of much smaller graphs from similar sources. Third, we show that ... exhibits over 90% parallel efficiency on massive graphs in weak scaling experiments...
  • SHELL2

  • Referenced in 8 articles [sw16623]
  • loop Feynman graphs with external lines corresponding to massive as well as massless particles...
  • gMark

  • Referenced in 1 article [sw27483]
  • Driven Generation of Graphs and Queries. Massive graph data sets are pervasive in contemporary application...
  • GraphCT

  • Referenced in 1 article [sw06629]
  • GraphCT: Multithreaded Algorithms for Massive Graph Analysis The digital world has given rise to massive...
  • PMC

  • Referenced in 1 article [sw21471]
  • searched, thus lowering memory-requirements for massive graphs, increases speed, and has caching benefits...
  • DoQO

  • Referenced in 1 article [sw08906]
  • with many body interactions on arbitrary graphs using massively parallel distributed memory machines...
  • FedGraphNN

  • Referenced in 1 article [sw41837]
  • data. However, centralizing a massive amount of real-world graph data for GNN training...
  • SCIP-Jack

  • Referenced in 16 articles [sw18748]
  • parallelization extensions. The Steiner tree problem in graphs is a classical problem that commonly arises ... performance solver that can be employed in massively parallel environments and is capable of solving...
  • rgexf

  • Referenced in 1 article [sw26014]
  • weighting. Users can build/handle graphs element-by-element or massively through data-frames, visualize...
  • Giraph

  • Referenced in 7 articles [sw18984]
  • open-source counterpart to Pregel, the graph processing architecture developed at Google and described ... potential of structured datasets at a massive scale. To learn more, consult the User Docs...
  • GraphR

  • Referenced in 1 article [sw35259]
  • paper presents GRAPHR, the first ReRAM-based graph processing accelerator. GRAPHR follows the principle ... processing and explores the opportunity of performing massive parallel analog operations with low hardware ... analog computation is suit- able for graph processing because: 1) The algorithms are iterative ... graph computation is not new, but ReRAM offers the unique opportunity to realize the massive...
  • GiViP

  • Referenced in 1 article [sw27736]
  • deal with big graphs, the tasks of profiling and debugging their massive computations remain time ... presents GiViP, a visual profiler for distributed graph processing systems based on a Pregel-like...
  • ViWoSG

  • Referenced in 1 article [sw02042]
  • distributed scene graph of ultramassive distributed virtual environments An ultra-massive distributed virtual environment generally ... consists of ultra-massive terrain data and a large quantity of objects and their attribute ... novel method for constructing distributed scene graphs with high extensibility. This method can support high...