Journal ArticleDOI
Recognizing unordered depth-first search trees of an undirected graph in parallel
Reads0
Chats0
TLDR
An efficient parallel algorithm is proposed for determining whether T is an unordered depth-first search tree of G, which runs in O(m/p+log m) time using p processors on the EREW PRAM.Abstract:
Let G be an undirected graph and T be a spanning tree of G. In this paper, an efficient parallel algorithm is proposed for determining whether T is an unordered depth-first search tree of G. The proposed algorithm runs in O(m/p+log m) time using p processors on the EREW PRAM, where m is the number of edges contained in G. It is cost-optimal and achieves linear speedup.read more
Citations
More filters
Proceedings ArticleDOI
Parallel Depth-First Search for Directed Acyclic Graphs
TL;DR: This work proposes a novel work-efficient parallel algorithm for the DFS traversal of directed acyclic graph (DAG) that outperforms sequential DFS on the CPU by up to 6x in the authors' experiments.
Journal ArticleDOI
The Recognition Problem of Graph Search Trees
Jesse Beisegel,Carolin Denkert,Ekkehard Köhler,Matjaž Krnc,Nevena Pivač,Robert Scheffler,Martin Strehler +6 more
TL;DR: In this article, the problem of deciding whether a given spanning tree of a graph is a spanning tree or not is considered, and the problem is formulated as a graph search problem.
Book ChapterDOI
An Event-Driven Algorithm for Agents on the Web
TL;DR: This chapter describes how meta-agents in a multi-agent system can be used to effectively search for services in networks with an event-driven algorithm.
Journal ArticleDOI
On the recognition of search trees generated by BFS and DFS
TL;DR: In this paper , it was shown that swapping the search-tree paradigms between these searches makes the problem hard, i.e., it is NP-complete to decide whether a spanning tree of a graph is a first-in-tree of a DFS or a last-intree of BFS.
Journal ArticleDOI
Graph-Based Deep Decomposition for Overlapping Large-Scale Optimization Problems
Xin Zhang,Bo-Wen Ding,Xin Xu,Jian-Yu Li,Zhi-Hui Zhan,Pengjiang Qian,Wei Hua Fang,Kuei-Kuei Lai,Jun Zhang +8 more
TL;DR: Wang et al. as discussed by the authors proposed a graph-based deep decomposition (GDD) method to obtain more accurate grouping results, especially for the overlapping problems, which is highly fault tolerant and can divide problems accurately even on the inaccurate IaV.
References
More filters
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Book
An introduction to parallel algorithms
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Book
Introduction to Parallel Algorithms
C. Xavier,S. S. Iyengar +1 more
TL;DR: Algorithms for Parallel Computing: Algebraic Equations and Matrices, Differentiation and Integration, and Tree Algorithms.
Book
On Finding Lowest Common Ancestors: Simplification and Parallelization
Baruch Schieber,Uzi Vishkin +1 more
TL;DR: A linear time and space preprocessing algorithm that enables us to answer each query in $O(1)$ time, as in Harel and Tarjan, which has the advantage of being simple and easily parallelizable.
Book
An Efficient Parallel Biconnectivity Algorithm
Robert E. Tarjan,Uzi Vishkin +1 more
TL;DR: A new algorithm for finding the blocks (biconnected components) of an undirected graph and a general algorithmic technique that simplifies and improves computation of various functions on trees is introduced.