Suchergebnisse - "parallel graph algorithm"

Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint von Keller, Jörg, Litzinger, Sebastian

“… We investigate the performance of algorithms that explore large state graphs of finite state machines without input by following paths. To improve on …”
Volltext

Anti-Section Transitive Closure von Green, Oded, Du, Zhihui, Patel, Sanyamee, Xie, Zehui, Liu, Hang, Bader, David A.

“… The transitive closure of a graph is a new graph where every vertex is directly connected to all vertices to which it had a path in the original graph …”
Volltext

Parallel Algorithm for Single-Source Earliest-Arrival Problem in Temporal Graphs von Peng Ni, Hanai, Masatoshi, Wen Jun Tan, Chen Wang, Wentong Cai

“… Many real-world networks, including online social networks and communication networks, are commonly modeled as temporal graphs. Answering earliest-arrival …”
Volltext

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling von van der Grinten, Alexander, Meyerhenke, Henning

“… Betweenness centrality is one of the most popular vertex centrality measures in network analysis. Hence, many (sequential and parallel) algorithms to compute …”
Volltext

Ant Colony-Inspired Parallel Algorithm to Improve Cryptographic Pseudo Random Number Generators von Keller, Jorg, Spenger, Gabriele, Wendzel, Steffen

“… We present a parallel algorithm to compute promising candidate states for modifying the state space of a pseudo-random number generator in order to increase …”
Volltext

Parallel Breadth First Search on GPU clusters von Zhisong Fu, Dasari, Harish Kumar, Bebee, Bradley, Berzins, Martin, Thompson, Bryan

“… Fast, scalable, low-cost, and low-power execution of parallel graph algorithms is important for a wide variety of commercial and public sector applications …”
Volltext

An efficient parallel graph edge matching algorithm and its applications von Ma, Jun, Ma, Shaohan

“… A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graphG(V,E) is proposed. It runs inO(logn) time with (M/logn+n) …”
Volltext

Finding biconnected componemts and computing tree functions in logarithmic parallel time von Tarjan, R.E., Vishkin, U.

“… We propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a …”
Volltext

GreediRIS: Scalable influence maximization using distributed streaming maximum cover von Barik, Reet, Cappa, Wade, Ferdous, S.M., Minutoli, Marco, Halappanavar, Mahantesh, Kalyanaraman, Ananth

“… Influence maximization—the problem of identifying a subset of k influential seeds (vertices) in a network—is a classical problem in network science with …”
Volltext

Practical parallel algorithms for compact spanners on real world graphs von Pathak, Maulein, Sabharwal, Yogish, Gupta, Neelima

Volltext

NetworKit: A tool suite for large-scale complex network analysis von STAUDT, CHRISTIAN L., SAZONOVS, ALEKSEJS, MEYERHENKE, HENNING

“… We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required …”
Volltext

Towards scaling community detection on distributed-memory heterogeneous systems von Gawande, Nitin, Ghosh, Sayan, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth

“… In most real-world networks, nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters such that nodes within a community …”
Volltext

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs von Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos

“… Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification …”
Volltext

A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation von Yu, Ting, Liu, Mengchi

“… •We propose a memory efficient method, CMC-bit, for maximal clique enumeration on real-world sparse graphs.•We use an efficient order strategy to reduce both …”
Volltext

BFS-4K: An Efficient Implementation of BFS for Kepler GPU Architectures von Busato, Federico, Bombieri, Nicola

“… Breadth-first search (BFS) is one of the most common graph traversal algorithms and the building block for a wide range of graph applications. With the advent …”
Volltext

A performance predictor for implementation selection of parallelized static and temporal graph algorithms von Rehman, Akif, Ahmad, Masab, Khan, Omer

“… Task‐based execution of graph workloads allows various ordered and unordered implementations, with tasks representing dependencies between graph vertices and …”
Volltext

Performance Evaluation of Parallel Graphs Algorithms Utilizing Graphcore IPU von Gepner, Paweł, Kocot, Bartłomiej, Paprzycki, Marcin, Ganzha, Maria, Moroz, Leonid, Olas, Tomasz

“… Recent years have been characterized by increasing interest in graph computations. This trend can be related to the large number of potential application …”
Volltext

Graph coloring algorithms for multi-core and massively multithreaded architectures von Çatalyürek, Ümit V., Feo, John, Gebremedhin, Assefaw H., Halappanavar, Mahantesh, Pothen, Alex

“… ► We explore the interplay between architectures and algorithm design for graph problems. ► We target multi-core platforms and a massively multithreaded …”
Volltext

High-performance and balanced parallel graph coloring on multicore platforms von Giannoula, Christina, Peppas, Athanasios, Goumas, Georgios, Koziris, Nectarios

“… Graph coloring is widely used to parallelize scientific applications by identifying subsets of independent tasks that can be executed simultaneously. Graph …”
Volltext

Distributed Graph Diameter Approximation von Ceccarello, Matteo, Pietracaprina, Andrea, Pucci, Geppino, Upfal, Eli

“… We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction …”
Volltext