Parallel Algorithms for Evaluating Centrality for Weighted Graphs
نویسندگان
چکیده
منابع مشابه
Attachment Centrality for Weighted Graphs
Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity. Unfortunately, the Attachment Centrality is defined only for unwei...
متن کاملParallel algorithms for transitive reduction for weighted graphs
We present a generalization of transitive reduction for weighted graphs and give scalable polynomial algorithms for computing it based on the Floyd-Warshall algorithm for finding shortest paths in graphs. We also show how the algorithms can be optimized for memory efficiency and effectively parallelized to improve the run time. As a consequence, the algorithms can be tuned for modern general pu...
متن کاملImproved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs
Arnato. N., Improved processor bounds for parallel algorithms for weighted directed graphs, Information Processing Letters
متن کاملParallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − times the maximum for any given constant > 0. The second one is an NC approximation a...
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018917973