Add to ORKGk-edge connectivity augmentation problems in graph theory are bringing to more and more attention along with extensive applications of parallel computing and network technology. Early research has proved that general augmentation problems are NP-hard, but there are polynomial-time sequential algorithms for some subproblems, in which k = 2 and weights of all edges in edge set of complement of graph are equal. In this paper a parallel algorithm for above subproblems running in O(log n) time and using O(n+m) processors on SIMD PRAM CRCW is presented.EI05694-6993
We consider the problem of computing a b-MATCHING and a b-EDGE COVER, which are subgraphs of a graph...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
We prove that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of In...
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at le...
Given an undirected graph G = (V, E) with |V| = n, and a feasible set E of m weighted edges on V, th...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
Given a graph G of n vertices and m edges, and a spanning subgraph H of G, the problem of nding a mi...
Abstract The network reliability in multi-server environment is measured by the connectivity between...
AbstractIn this paper, we consider the augmentation problem of an undirected graph with k partitions...
[[abstract]]In this paper, we consider the augmentation problem of an undirected graph with k partit...
We deal with the maximum cut problem on cubic graphs and we present a simple O(log n) time parallel ...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 Rome / CNR - Consiglio ...
For a weighted, undirected graph G = (V,E), the single most vital edge in a network with respect to ...
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the compo...
We consider the problem of computing a b-MATCHING and a b-EDGE COVER, which are subgraphs of a graph...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
We prove that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of In...
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at le...
Given an undirected graph G = (V, E) with |V| = n, and a feasible set E of m weighted edges on V, th...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
Given a graph G of n vertices and m edges, and a spanning subgraph H of G, the problem of nding a mi...
Abstract The network reliability in multi-server environment is measured by the connectivity between...
AbstractIn this paper, we consider the augmentation problem of an undirected graph with k partitions...
[[abstract]]In this paper, we consider the augmentation problem of an undirected graph with k partit...
We deal with the maximum cut problem on cubic graphs and we present a simple O(log n) time parallel ...
Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 Rome / CNR - Consiglio ...
For a weighted, undirected graph G = (V,E), the single most vital edge in a network with respect to ...
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the compo...
We consider the problem of computing a b-MATCHING and a b-EDGE COVER, which are subgraphs of a graph...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...