IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-30165-5_30.html
   My bibliography  Save this book chapter

Graph Domination, Coloring and Cliques in Telecommunications

In: Handbook of Optimization in Telecommunications

Author

Listed:
  • Balabhaskar Balasundaram

    (Texas A&M University, Department of Industrial Engineering)

  • Sergiy Butenko

    (Texas A&M University, Department of Industrial Engineering)

Abstract

This chapter aims to provide a detailed survey of existing graph models and algorithms for important problems that arise in different areas of wireless telecommunication. In particular, applications of graph optimization problems such as minimum dominating set, minimum vertex coloring and maximum clique in multihop wireless networks are discussed. Different forms of graph domination have been used extensively to model clustering in wireless ad hoc networks. Graph coloring problems and their variants have been used to model channel assignment and scheduling type problems in wireless networks. Cliques are used to derive bounds on chromatic number, and are used in models of traffic flow, resource allocation, interference, etc. In this chapter we survey the solution methods proposed in the literature for these problems and some recent theoretical results that are relevant to this area of research in wireless networks.

Suggested Citation

  • Balabhaskar Balasundaram & Sergiy Butenko, 2006. "Graph Domination, Coloring and Cliques in Telecommunications," Springer Books, in: Mauricio G. C. Resende & Panos M. Pardalos (ed.), Handbook of Optimization in Telecommunications, chapter 30, pages 865-890, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-30165-5_30
    DOI: 10.1007/978-0-387-30165-5_30
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-30165-5_30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.