Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Computing

IWDC 2002: Distributed Computing pp 312–318Cite as

Approximating the Range Sum of a Graph on CREW PRAM

  • Conference paper
  • First Online:

  • 265 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2571))

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. V. Kale, Ben Richards, and Terry Allen. Efficient parallel graph coloring with prioritization. Lecture Notes in Computer Science, 1996.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Gary Lewandowski. Practical Implementations and Applications of Graph Coloring. PhD thesis, University of Wisconsin-Madison, August 1994.

    Google Scholar 

  4. Andreas Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35(1):8–14, 1986.

    Article  Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. 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.

    Google Scholar 

  7. Ewa Kubicka and A. J. Schwenk, An Introduction to Chromatic Sums, Proc. of ACM Computer Science Conference, pp. 39–45, 1989.

    Google Scholar 

  8. Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable Parallel Graph Coloring Algorithms, Concurrency: Pract. Exper. 2000, 12:1131–1146.

    Article  MATH  Google Scholar 

  9. 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.

    Google Scholar 

  10. Magnús M. Halldórsson. Parallel and on-line graph coloring. Journal of Algorithms, 23(2):265–280, May 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology Kanpur, 208 016, Kanpur, India

    Saurabh Srivastava & Phalguni Gupta

Authors
  1. Saurabh Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phalguni Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Texas at Arlington Center for Research in Wireless Mobility and Networking (CReWMaN), P.O. Box 19015, 76019-0015, Arlington, TX, USA

    Sajal K. Das

  2. Department of Computer Science and Engineering, Jadavpur University, 700 032, Calcutta

    Swapan Bhattacharya

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation