A faster algorithm for finding maximum independent sets in sparse graphs

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Scopus citations

    Abstract

    An algorithm is presented for finding a maximum independent set in a connected graph with n vertices and m edges in time O(poly(n)1.2365 m-n). As a consequence, we find a maximum independent set in a graph of degree 3 in time O(poly (n)1.1120n), which improves the currently best results of O(1.1254n) of Chen, Kanj and Xia.

    Original languageEnglish (US)
    Title of host publicationLATIN 2006
    Subtitle of host publicationTheoretical Informatics - 7th Latin American Symposium, Proceedings
    PublisherSpringer Verlag
    Pages491-501
    Number of pages11
    ISBN (Print)354032755X, 9783540327554
    DOIs
    StatePublished - Jan 1 2006
    EventLATIN 2006: Theoretical Informatics - 7th Latin American Symposium - Valdivia, Chile
    Duration: Mar 20 2006Mar 24 2006

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3887 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    OtherLATIN 2006: Theoretical Informatics - 7th Latin American Symposium
    CountryChile
    CityValdivia
    Period3/20/063/24/06

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'A faster algorithm for finding maximum independent sets in sparse graphs'. Together they form a unique fingerprint.

    Cite this