Results 1  10
of
109,933
MAXIMAL VERTEXCONNECTIVITY OF −−→ Sn,k
"... Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain deficiencies. A class of generalization of star graphs called (n, k)star graphs was introduced in [12] to address these issues. In this paper we will consider the vertexconnectivity of the ..."
Abstract
 Add to MetaCart
Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain deficiencies. A class of generalization of star graphs called (n, k)star graphs was introduced in [12] to address these issues. In this paper we will consider the vertexconnectivity
A Note On The VertexConnectivity Augmentation Problem
, 1997
"... Using the polynomial algorithm given in [4] a kconnected undirected graph G = (V; E) can be made (k + 1)connected by adding at most k \Gamma 2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slight ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Using the polynomial algorithm given in [4] a kconnected undirected graph G = (V; E) can be made (k + 1)connected by adding at most k \Gamma 2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a
Undirected VertexConnectivity Structure and Smallest FourVertexConnectivity Augmentation
 Proc. 6th ISAAC
, 1995
"... In this paper, we study properties for the structure of an undirected graph that is not 4vertexconnected. We also study the evolution of this structure when an edge is added to optimally increase the vertexconnectivity of the underlying graph. Several properties reported here can be extended t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we study properties for the structure of an undirected graph that is not 4vertexconnected. We also study the evolution of this structure when an edge is added to optimally increase the vertexconnectivity of the underlying graph. Several properties reported here can be extended
A simple parallel algorithm for the maximal independent set problem
 SIAM Journal on Computing
, 1986
"... Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intel ..."
Abstract

Cited by 458 (10 self)
 Add to MetaCart
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Results 1  10
of
109,933