Paper Info
Title
Approximating the Range Sum of a Graph on CREW PRAM
Abstract
In this paper we have studied the problem of finding the range sum of a graph G =驴 V,E 驴 which is to color the vertices of a graph with ranges from a specified set in such a way that adjacent vertices are colored with non-overlapping ranges and the sum of the lengths of the ranges is the maximum possible. The problem of finding a good approximation to the range sum is often encountered in many engineering problems. We have presented an efficient parallel algorithm for computing an approximate solution to the range sum problem of a graph on CREW PRAM.
Year
DOI
Venue
2002
10.1007/3-540-36385-8_31
IWDC
Keywords
Field
DocType
adjacent vertex,crew pram,range sum problem,approximate solution,range sum,engineering problem,graph g,non-overlapping range,efficient parallel algorithm,good approximation,parallel algorithm
Graph,Discrete mathematics,Combinatorics,Colored,Crew,Vertex (geometry),Parallel algorithm,Neighbourhood (graph theory),Greedy algorithm,Mathematics,Graph coloring
Conference
Volume
ISSN
ISBN
2571
0302-9743
3-540-00355-X
Citations 
PageRank 
References 
0
0.34
6
Authors
2
Name
Order
Citations
PageRank
Saurabh Srivastava118419.27
Phalguni Gupta280582.58