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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. V. Kale, Ben Richards, and Terry Allen. Efficient parallel graph coloring with prioritization. Lecture Notes in Computer Science, 1996.
Gary Lewandowski and Anne Condon, Experiments with parallel graph coloring heuristics and applications of graph coloring, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 309–334, 1993.
Gary Lewandowski. Practical Implementations and Applications of Graph Coloring. PhD thesis, University of Wisconsin-Madison, August 1994.
Andreas Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35(1):8–14, 1986.
G. J. Chaitin, M. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins and P. Markstein. Register Allocation via coloring. Computer Languages, 6:47–57, 1981.
S. Srivastava, S. Tripathi. Resource Optimization in CDMA based Wireless Ad Hoc Networks. BTP Report 2001-2002, Department of Computer Science and Engineering, IIT Kanpur.
Ewa Kubicka and A. J. Schwenk, An Introduction to Chromatic Sums, Proc. of ACM Computer Science Conference, pp. 39–45, 1989.
Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable Parallel Graph Coloring Algorithms, Concurrency: Pract. Exper. 2000, 12:1131–1146.
Gjertsen, R. K., Jr., M. T. Jones, P. E. Plassmann. 1996. Parallel Heuristics for Improved, Balanced Graph Colorings. Journal of Parallel and Distributed Computing 37:171–186.
Magnús M. Halldórsson. Parallel and on-line graph coloring. Journal of Algorithms, 23(2):265–280, May 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srivastava, S., Gupta, P. (2002). Approximating the Range Sum of a Graph on CREW PRAM. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-36385-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00355-7
Online ISBN: 978-3-540-36385-9
eBook Packages: Springer Book Archive