Results 1  10
of
1,563
On the Strongly Connected and Biconnected Components of the Complement of Graphs
, 2004
"... In this paper, we consider the problems of computing the strongly connected components and the biconnected components of the complement of a given graph. In particular, for a directed graph G on n vertices and m edges, we present a simple algorithm for computing the strongly connected components of ..."
Abstract
 Add to MetaCart
In this paper, we consider the problems of computing the strongly connected components and the biconnected components of the complement of a given graph. In particular, for a directed graph G on n vertices and m edges, we present a simple algorithm for computing the strongly connected components
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1384 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
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
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
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
A Partial KArboretum of Graphs With Bounded Treewidth
 J. Algorithms
, 1998
"... The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes ..."
Abstract

Cited by 328 (34 self)
 Add to MetaCart
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between
Pathbased depthfirst search for strong and biconnected components
 Information Processing Letters
, 2000
"... Key words: Graph, depthfirst search, strongly connected component, biconnected component, stack. ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
Key words: Graph, depthfirst search, strongly connected component, biconnected component, stack.
The Biconnected Verification of Workflow Nets
"... Abstract. Formal representations of business processes are used for analysis of the process behavior. Workflow nets are a widely used formalism for describing the behavior of business processes. Structure theory of processes investigates the relation between the structure of a model and its behavi ..."
Abstract
 Add to MetaCart
behavior. In this paper, we propose to employ the connectivity property of workflow nets as an angle to their structural analysis. In particular, we show how soundness verification can be organized using biconnected components of a workflow net. This allows for efficient identification and localization
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
connectivity. Specifically, based on the directional information, a node grows it transmission power until it finds a neighbor node in every direction. The resulting network topology increases network lifetime by reducing transmission power and reduces traffic interference by having low node degrees. Moreover
Results 1  10
of
1,563