IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v3y2012i1p24-33.html
   My bibliography  Save this article

A Generalized Graph Strict Strong Coloring Algorithm

Author

Listed:
  • Mourad Bouzenada

    (MISC Laboratory, University Mentouri Constantine, Algeria)

  • Meriem Bensouyad

    (MISC Laboratory, University Mentouri Constantine, Algeria)

  • Nousseiba Guidoum

    (MISC Laboratory, University Mentouri Constantine, Algeria)

  • Ahmed Reghioua

    (MISC Laboratory, University Mentouri Constantine, Algeria)

  • Djamel-eddine Saïdouni

    (MISC Laboratory, University Mentouri Constantine, Algeria)

Abstract

This paper examines the graph coloring problem. A graph strict strong coloring algorithm has been proposed for trees in Haddad and Kheddouci (2009). In this paper, the authors propose a new heuristic based algorithm for general graphs named GGSSCA (for Generalized Graph Strict Strong Coloring Algorithm). The authors show that the complexity of this algorithm is polynomial with considering the number of vertices.

Suggested Citation

  • Mourad Bouzenada & Meriem Bensouyad & Nousseiba Guidoum & Ahmed Reghioua & Djamel-eddine Saïdouni, 2012. "A Generalized Graph Strict Strong Coloring Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 3(1), pages 24-33, January.
    • Handle: RePEc:igg:jamc00:v:3:y:2012:i:1:p:24-33
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2012010103
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jamc00:v:3:y:2012:i:1:p:24-33. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.