scholarly journals Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations

2017 ◽  
Author(s):  
George M Slota ◽  
Sivasankaran Rajamanickam ◽  
Kamesh Madduri
Keyword(s):  
Parallel Graph ◽  
Vertex Order

Parallel Graph Partitioning on Multicore Architectures

2011 ◽  
pp. 246-260 ◽  
Author(s):  
Xin Sui ◽  
Donald Nguyen ◽  
Martin Burtscher ◽  
Keshav Pingali
Keyword(s):  
Graph Partitioning ◽  
Multicore Architectures ◽  
Parallel Graph

MATCHING POLYNOMIALS OF SERIES-PARALLEL GRAPHS

1993 ◽  
Vol 03 (01) ◽  
pp. 13-18 ◽  
Author(s):  
LIH-HSING HSU
Keyword(s):  
Parallel Algorithm ◽  
Efficient Algorithm ◽  
Matching Polynomial ◽  
Erew Pram ◽  
Parallel Graph

We present an efficient algorithm for computing the matching polynomial of a series-parallel graph in O(n2) time. This algorithm improves on the previous result of O(n3). We also present a cost-optimal parallel algorithm for computing the matching polynomial of a series-parallel graph using an EREW PRAM computer with the number of processors p less than n2/ log n.

scholarly journals A random hierarchical lattice: the series-parallel graph and its properties

2004 ◽  
Vol 36 (03) ◽  
pp. 824-838 ◽  
Author(s):  
B. M. Hambly ◽  
Jonathan Jordan
Keyword(s):  
Phase Transition ◽  
Random Graphs ◽  
Effective Resistance ◽  
First Passage Percolation ◽  
Hierarchical Lattice ◽  
First Passage ◽  
In Series ◽  
Parallel Graph

We consider a sequence of random graphs constructed by a hierarchical procedure. The construction replaces existing edges by pairs of edges in series or parallel with probability p. We investigate the effective resistance across the graphs, first-passage percolation on the graphs and the Cheeger constants of the graphs as the number of edges tends to infinity. In each case we find a phase transition at

scholarly journals PT-Scotch: A tool for efficient parallel graph ordering

2008 ◽  
Vol 34 (6-8) ◽  
pp. 318-331 ◽  
Author(s):  
C. Chevalier ◽  
F. Pellegrini
Keyword(s):  
Parallel Graph

Parallel graph analytics

2016 ◽  
Vol 59 (5) ◽  
pp. 78-87 ◽  
Author(s):  
Andrew Lenharth ◽  
Donald Nguyen ◽  
Keshav Pingali
Keyword(s):  
Graph Analytics ◽  
Parallel Graph

Implementation an XML Multi-Signature Scheme for XML Data Authentication

2011 ◽  
Vol 65 ◽  
pp. 236-240
Author(s):  
Bao Long Liu ◽  
Hua Chen ◽  
Yi Guo
Keyword(s):  
Signature Scheme ◽  
Hierarchical Network ◽  
Xml Data ◽  
Data Authentication ◽  
Multiple Data ◽  
Xml Signature ◽  
Parallel Graph

XML signature is used to ensure XML data authentication. An XML multi-signature should satisfy multiple data authentication requirements for XML data which passes a hierarchical network of different responsibilities. Based on presented series-parallel XML multi-signature scheme, the implementation of a series-parallel XML multi-signature scheme is illustrated. The paper describes the algorithm for possible XPath in DTD, algorithm for series-parallel graph converting to sub-signing group, and the presentation for signed results.

Sign in / Sign up

Export Citation Format

Share Document