Results 1  10
of
1,992
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Lightweight causal and atomic group multicast
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1991
"... ..."
An efficient parallel biconnectivity algorithm
 SIAM J. Computing
, 1985
"... Abstract. In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(n + m) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(n + m) space using O(n + m) p ..."
Abstract

Cited by 107 (5 self)
 Add to MetaCart
Abstract. In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(n + m) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(n + m) space using O(n + m
An Incremental Distributed Algorithm for Computing Biconnected Components
 In Proceedings of the 8th International Workshop on Distributed Algorithms
, 1994
"... This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b 0 + c) messages for an edge removal, and a worst case time complexity o ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b 0 + c) messages for an edge removal, and a worst case time complexity
Distributed topology control for power efficient operation in multihop wireless ad hoc networks
, 2001
"... Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connecti ..."
Abstract

Cited by 380 (18 self)
 Add to MetaCart
Abstract — The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global
AN OPTIMAL DISTRIBUTED EDGEBICONNECTIVITY ALGORITHM
, 2006
"... Abstract. We describe a synchronous distributed algorithm which identifies the edgebiconnected components of a connected network. It requires a leader, and uses messages of size O(log V ). The main idea is to preorder a BFS spanning tree, and then to efficiently compute least common ancestors so ..."
Abstract
 Add to MetaCart
Abstract. We describe a synchronous distributed algorithm which identifies the edgebiconnected components of a connected network. It requires a leader, and uses messages of size O(log V ). The main idea is to preorder a BFS spanning tree, and then to efficiently compute least common ancestors so
Biconnectivity Approximations and Graph Carvings
, 1994
"... A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified) ? Unfortunately, the problem is known to be ..."
Abstract

Cited by 97 (5 self)
 Add to MetaCart
to be NP hard. We consider the problem of finding a better approximation to the smallest 2connected subgraph, by an efficient algorithm. For 2edge connectivity our algorithm guarantees a solution that is no more than 3 2 times the optimal. For 2vertex connectivity our algorithm guarantees a solution
SubLinear Distributed Algorithms for Sparse Certificates and Biconnected Components.
, 1995
"... A certificate for the k connectivity y of a graph G = (V; E) is a subset E 0 of E such that (V; E 0 ) is k connected iff G is k connected. Let n = jV j and m = jEj. A certificate is called sparse if it has size O(kn). We present a distributed algorithm for computing sparse certificate for k co ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
connectivity whose time complexity is O(k(D+n 0:614 )) where D is the diameter of the network. A new algorithm for identifying biconnected components is also presented. This algorithm is significantly simpler than many existing algorithms and can be implemented in a distributed environment to run in O(D+n 0
RealTime Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components∗
, 2012
"... In this paper we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, and connected and biconnected components. The motivation of our work was the development of a realtime algorithm to mo ..."
Abstract
 Add to MetaCart
In this paper we present the first algorithm in the streaming model to characterize completely the biconnectivity properties of undirected networks: articulation points, bridges, and connected and biconnected components. The motivation of our work was the development of a realtime algorithm
Computing Bridges, Articulations, and 2Connected Components in Wireless Sensor Networks
, 2006
"... This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2connected components in asynchronous networks with an at least once message delivery semantics in time O(n) using at most 4m messages of length O(lg n). The algorithm does not assume a FIFO rule ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2connected components in asynchronous networks with an at least once message delivery semantics in time O(n) using at most 4m messages of length O(lg n). The algorithm does not assume a FIFO rule
Results 1  10
of
1,992