Sciweavers

774 search results - page 7 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ICPP
1994
IEEE
13 years 11 months ago
A New Approach to Scheduling Parallel Programs Using Task Duplication
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
Ishfaq Ahmad, Yu-Kwong Kwok
EUROPAR
2005
Springer
14 years 1 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
CORR
2007
Springer
181views Education» more  CORR 2007»
13 years 7 months ago
A new lower bound on the independence number of a graph
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
Ossama Kettani
IPPS
1999
IEEE
13 years 12 months ago
A new Architecture for Multihop Optical Networks
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
Arunita Jaekel, Subir Bandyopadhyay, Abhijit Sengu...