Results 1  10
of
27
Programming Parallel Algorithms
, 1996
"... In the past 20 years there has been treftlendous progress in developing and analyzing parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most problems for which efficient sequential solutions are known. Although some ofthese algorithms are efficient only in a th ..."
Abstract

Cited by 193 (9 self)
 Add to MetaCart
In the past 20 years there has been treftlendous progress in developing and analyzing parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most problems for which efficient sequential solutions are known. Although some ofthese algorithms are efficient only in a theoretical framework, many are quite efficient in practice or have key ideas that have been used in efficient implementations. This research on parallel algorithms has not only improved our general understanding ofparallelism but in several cases has led to improvements in sequential algorithms. Unf:ortunately there has been less success in developing good languages f:or prograftlftling parallel algorithftls, particularly languages that are well suited for teaching and prototyping algorithms. There has been a large gap between languages
Rigidity, Computation, and Randomization in Network Localization
 In Proceedings of IEEE INFOCOM ’04, Hong Kong
, 2004
"... In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigid ..."
Abstract

Cited by 84 (14 self)
 Add to MetaCart
In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
A Theory of Network Localization
, 2004
"... In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigid ..."
Abstract

Cited by 67 (6 self)
 Add to MetaCart
In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity
 Synthesis of Parallel Algorithms
, 1992
"... This report deals with a parallel algorithmic technique that has proved to be very useful in the design of efficient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called "open ear decomposition", and we relate thi ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
This report deals with a parallel algorithmic technique that has proved to be very useful in the design of efficient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called "open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an efficient parallel algorithm for finding this decomposition and we relate it to a sequential algorithm based on depthfirst search. We then apply open ear decomposition to obtain an efficient parallel algorithm for testing graph triconnectivity and for finding the triconnnected components of a graph.
Improved algorithms for graph fourconnectivity
 J. Comp. System Sci
, 1991
"... We present a new algorithm based on open ear decomposition for testing vertex fourconnectivity and for finding all separating triplets in a triconnected graph. A sequential implementation of our algorithm runs in O(n 2) time and a parallel implementation runs in O(log 2 n) time using O(n 2) process ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
We present a new algorithm based on open ear decomposition for testing vertex fourconnectivity and for finding all separating triplets in a triconnected graph. A sequential implementation of our algorithm runs in O(n 2) time and a parallel implementation runs in O(log 2 n) time using O(n 2) processors on an ARBITRARY CRCW PRAM, where n is the number of vertices in the graph. This improves previous bounds for the problem for both the sequential and parallel cases. The sequential time bound is the best possible, to within a constant factor, if the input is specified in adjacency matrix form, or if the input graph is dense. 1.
Towards overcoming the transitiveclosure bottleneck: efficient parallel algorithms for planar digraphs
 J. Comput. System Sci
, 1993
"... Abstract. Currently, there is a significant gap between the best sequential and parallel complexities of many fundamental problems related to digraph reachability. This complexity bottleneck essentially reflects a seemingly unavoidable reliance on transitive closure techniques in parallel algorithms ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. Currently, there is a significant gap between the best sequential and parallel complexities of many fundamental problems related to digraph reachability. This complexity bottleneck essentially reflects a seemingly unavoidable reliance on transitive closure techniques in parallel algorithms for digraph reachability. To pinpoint the nature of the bottleneck, we de* velop a collection of polylogtime reductions among reachability problems. These reductions use only linear processors and work for general graphs. Furthermore, for planar digraphs, we give polylogtime algorithms for the following problems: (1) directed ear decomposition, (2) topological ordering, (3) digraph reachability, (4) descendent counting, and (5) depthfirst search. These algorithms use only linear processors and therefore reduce the complexity to within a polylog factor of optimal.
Limit Points for Average Genus (I): 3Connected and 2Connected Simplicial Graphs
 J. Combinatorial Theory B
, 1992
"... It is demonstrated that a given value of average genus is shared by at most finitely many 2connected simplicial graphs and by at most finitely many 3connected graphs. Moreover, the distribution of values of average genus is sparse, in the following sense: within any finite real interval, there are ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
It is demonstrated that a given value of average genus is shared by at most finitely many 2connected simplicial graphs and by at most finitely many 3connected graphs. Moreover, the distribution of values of average genus is sparse, in the following sense: within any finite real interval, there are at most finitely many different numbers that are values of average genus for 2connected simplicial graphs or for 3connected graphs. Thus, there are no limit points for the values of average genus of graphs in these classes. The potential applicability of these results to graph isomorphism testing is considered. April 27, 1992 1 Supported by Engineering Excellence Award from Texas A&M University. 2 Supported by ONR Contract N00014850768. CUCS02092 1 Introduction In this paper, one of a series, a topological invariant of recent interest, the average genus of graphs, is investigated. By the average genus of a graph G, we mean the average value of the genus of the imbedding surfa...
A Randomized Parallel Algorithm for Planar Graph Isomorphism
, 1999
"... We present a parallel randomized algorithm running on a CRCW PRAM , to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph (which can be computed by known algorithms in O(log 2 n) time with n 1 ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We present a parallel randomized algorithm running on a CRCW PRAM , to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph (which can be computed by known algorithms in O(log 2 n) time with n 1+ffl processors, for any ffl ? 0). If n is the number of vertices, our algorithm takes O(log(n)) time with P = O i n 1:5 \Delta p log(n) j processors and with probability of failure at most 1 n . The algorithm needs 2 \Delta log(m) \Delta log(n) +O(log(n)) random bits. The number of random bits can be decreased to O(log(n)) by increasing the number of processors to n 3 2 +ffl ; for any ffl ? 0: Our parallel algorithm has significantly improved processor efficiency, compared to the previous logorithmic time parallel algorithm of Miller and Reif [MR 91], which requires n 4 randomized processors or n 5 deterministic processors. Keywords: planar graphs, graph isomorph...
KuratowskiType Theorems for Average Genus
 J. Combinatorial Theory B
, 1992
"... Graphs of small average genus are characterized. In particular, a Kuratowskitype theorem is obtained: except for finitely many graphs, a cutedgefree graph has average genus less than or equal to 1 if and only if it is a necklace. We provide a complete list of those exceptions. A Kuratowskitype th ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Graphs of small average genus are characterized. In particular, a Kuratowskitype theorem is obtained: except for finitely many graphs, a cutedgefree graph has average genus less than or equal to 1 if and only if it is a necklace. We provide a complete list of those exceptions. A Kuratowskitype theorem for graphs of maximum genus 1 is also given. Some of the methods used in obtaining these results involve variations of a classical result of Whitney. April 27, 1992 1 Supported by Engineering Excellence Award from Texas A&M University, and by the National Science Foundation under Grant CCR9110824. 2 Supported by ONR Contract N00014850768. CUCS01992 1 Introduction By the average genus of a graph G, we mean the average value of the genus of the imbedding surface, taken over all orientable imbeddings of G. This value is evidently a rational number, and it is clearly an invariant of the homeomorphism type of a graph. The average genus of individual graphs is in the GrossFurst ...