• WebGraph

  • Referenced in 45 articles [sw30097]
  • storing web graphs (or, in general, integers with power-law distribution in a certain exponent ... provide a detailed mathematical analysis. Algorithms for compressing web graphs that exploit gap compression ... actually necessary. Algorithms for analysing very large graphs, such as HyperBall, which has been used ... complete, documented implementation of the algorithms above in Java distributed under the GNU General Public...
  • Reduze

  • Referenced in 72 articles [sw10354]
  • algorithm. This web page presents version 2 of the program. New features include the distributed ... load balancing job system. Fast graph and matroid based algorithms allow for the identification...
  • PSPIKE

  • Referenced in 16 articles [sw07072]
  • systems, real, parallel on distributed-memory clusters, combinatorial graph algorithms...
  • Graphs

  • Referenced in 104 articles [sw12277]
  • presented with a network (graph). A so-called preprocessing algorithm may compute certain information ... from various communities (sometimes under different names): algorithm engineers construct fast route planning methods; database ... distance labeling schemes in networking and distributed computing and for metric embeddings in geometry ... this survey, we review selected approaches, algorithms, and results on shortest-path queries from these...
  • PBGL

  • Referenced in 8 articles [sw04182]
  • Parallel and Distributed Graph Computation The Parallel BGL builds on the Boost Graph Library ... offering similar data structures, algorithms, and syntax for distributed, parallel computation that the BGL offers ... experimentation with and comparison of parallel graph algorithms and to provide solid implementations for solving...
  • CDMA/OVSF

  • Referenced in 12 articles [sw03215]
  • distributed CDMA/OVSF code assignment algorithms for wireless ad hoc networks modelled by unit disk graph ... first give a distributed code assignment whose total throughput is within a constant factor...
  • COCONUT

  • Referenced in 38 articles [sw04760]
  • graphs are implemented using the VGTL (Vienna Graph Template Library), and the search database ... removed. In addition, it is designed for distributed computing, and will probably be developed further ... parallel computing as wel! l. The solution algorithm is an advanced branch-and-bound scheme ... which proceeds by working on the search graph, a directed acyclic graph (DAG) of search...
  • Pregel

  • Referenced in 31 articles [sw13416]
  • that of its outgoing edges or mutate graph topology. This vertex-centric approach is flexible ... enough to express a broad set of algorithms. The model has been designed for efficient ... implied synchronicity makes reasoning about programs easier. Distribution-related details are hidden behind an abstract ... result is a framework for processing large graphs that is expressive and easy to program...
  • JUNG

  • Referenced in 11 articles [sw12112]
  • hypergraphs. It provides a mechanism for annotating graphs, entities, and relations with metadata. This facilitates ... current distribution of JUNG includes implementations of a number of algorithms from graph theory, data...
  • DEXTRA

  • Referenced in 3 articles [sw24935]
  • optimization over directed graphs. This paper develops a fast distributed algorithm, termed DEXTRA, to solve ... agents is described by a directed graph. Existing algorithms solve the problem restricted to directed...
  • Moca

  • Referenced in 5 articles [sw08801]
  • simple but very efficient algorithm for computing motorcycle graphs. An analysis of the mean trace ... rectangular grid, provided that the motorcycles are distributed sufficiently uniformly over the area covered ... This analysis motivates a simple algorithm for computing motorcycle graphs: We use the standard priority ... rectangular grid. If the motorcycles are distributed sufficiently uniformly, then our stochastic analysis predicts...
  • ScaleGraph

  • Referenced in 1 article [sw20265]
  • provide large-scale graph analysis algorithms and efficient distributed computing framework for graph analysts...
  • ViSiDiA

  • Referenced in 1 article [sw31241]
  • software visualizes the simulation of distributed algorithms, using graph rewriting rules, mobile agents or moving...
  • libPTScotch

  • Referenced in 3 articles [sw12562]
  • block orderings of distributed graphs. It gives brief descriptions of the algorithms, details the input/output ... number of examples. PT-Scotch is distributed as free/libre software, and has been designed such...
  • OpenGM

  • Referenced in 7 articles [sw21186]
  • template library for discrete factor graph models and distributive operations on these models. It includes ... state-of-the-art optimization and inference algorithms beyond message passing. OpenGM handles large models ... restrictions are imposed on the factor graph or the operations of the model. OpenGM...
  • DISCO

  • Referenced in 7 articles [sw13152]
  • distributed conformation of anchor-free graph realization problems: An SDP-based divide-and-conquer algorithm...
  • GeoSteiner

  • Referenced in 21 articles [sw04320]
  • influenced by Winter, published the Salowe-Warme algorithm. It used backtrack search to concatenate rectilinear ... finding minimum spanning trees in arbitrary hyper graphs, which was applied to the FST concatenation ... both rectilinear and Euclidean FSTs. The first distribution of the combined code therefore represented...
  • KronFit

  • Referenced in 41 articles [sw20428]
  • tails for the in- and out-degree distribution, heavy tails for the eigenvalues and eigenvectors ... graphs which we refer to as “Kronecker graphs”. First, we show that Kronecker graphs naturally ... also provide empirical evidence showing that Kronecker graphs can effectively model the structure of real ... then present KRONFIT, a fast and scalable algorithm for fitting the Kronecker graph generation model...
  • ADD-OPT

  • Referenced in 2 articles [sw25783]
  • directed optimization. In this paper, we consider distributed optimization problems where the goal ... connected, emph{directed} graph. The proposed algorithm, ADD-OPT (Accelerated Distributed Directed Optimization), achieves...
  • DDD

  • Referenced in 5 articles [sw12824]
  • Dynamic Graph Parallelisation Library. The parallel implementation of algorithms based on dynamic data structures ... architectures with distributed memory access leads to various technical problems as for data redundancy, consistency...