Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
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...
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...
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...
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...