IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p307-32010.1023-a1018965309522.html
   My bibliography  Save this article

A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph

Author

Listed:
  • Carlos Luz
  • Domingos Cardoso

Abstract

A family of quadratic programming problems whose optimal values are upper boundson the independence number of a graph is introduced. Among this family, the quadraticprogramming problem which gives the best upper bound is identified. Also the proof thatthe upper bound introduced by Hoffman and Lovász for regular graphs is a particular caseof this family is given. In addition, some new results characterizing the class of graphs forwhich the independence number attains the optimal value of the above best upper bound aregiven. Finally a polynomial-time algorithm for approximating the size of the maximumindependent set of an arbitrary graph is described and the computational experiments carriedout on 36 DIMACS clique benchmark instances are reported. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Carlos Luz & Domingos Cardoso, 1998. "A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph," Annals of Operations Research, Springer, vol. 81(0), pages 307-320, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:307-320:10.1023/a:1018965309522
    DOI: 10.1023/A:1018965309522
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018965309522
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018965309522?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Domingos M. Cardoso & Carlos J. Luz, 2016. "A simplex like approach based on star sets for recognizing convex- $$QP$$ Q P adverse graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 311-326, January.

    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:spr:annopr:v:81:y:1998:i:0:p:307-320:10.1023/a:1018965309522. 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.