A Parallel Algorithm for Subgraph Isomorphism

2019 ◽  
pp. 141-151
Author(s):  
Vincenzo Carletti ◽  
Pasquale Foggia ◽  
Pierluigi Ritrovato ◽  
Mario Vento ◽  
Vincenzo Vigilante
Keyword(s):  
Parallel Algorithm ◽  
Subgraph Isomorphism

A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform

2014 ◽  
Vol 513-517 ◽  
pp. 483-486
Author(s):  
Long Yuan ◽  
Wei Xin Tian
Keyword(s):  
Graph Theory ◽  
Parallel Algorithm ◽  
Matching Task ◽  
Subgraph Isomorphism ◽  
Hard Problem ◽  
Np Hard ◽  
Np Hard Problem ◽  
Current Algorithm ◽  
The Cost ◽  
Feasible Pair

Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory. The experiment shows that it has the better performance than current algorithm as the edges increase.

Parallel algorithm for Turbo codes

2010 ◽  
Vol 24 (7) ◽  
pp. 638-642
Author(s):  
Linli Cui ◽  
Fan Yang ◽  
Qicong Peng
Keyword(s):  
Parallel Algorithm ◽  
Turbo Codes

A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network

1988 ◽  
Author(s):  
Andrew V. Goldberg ◽  
Robert E. Tarjan
Keyword(s):  
Parallel Algorithm ◽  
Acyclic Network

Parallel algorithm for solving sparse linear systems

1996 ◽  
Vol 32 (19) ◽  
pp. 1766
Author(s):  
K.N. Balasubramanya Murthy ◽  
C. Siva Ram Murthy
Keyword(s):  
Parallel Algorithm ◽  
Linear Systems ◽  
Sparse Linear Systems

scholarly journals A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm

2014 ◽  
Vol 51 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Dawei Hong ◽  
Shushuang Man ◽  
Jean-Camille Birget ◽  
Desmond S. Lun
Keyword(s):  
Brownian Motion ◽  
Convergence Rate ◽  
Fractional Brownian Motion ◽  
Parallel Algorithm ◽  
Uniform Approximation ◽  
Haar Wavelets ◽  
Hurst Index ◽  
Sample Paths ◽  
Vanishing Moment ◽  
Uniform Expansion

We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (Bt(H))_t∈[0,1] of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.

Sign in / Sign up

Export Citation Format

Share Document