• DocumentCode
    1154374
  • Title

    An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

  • Author

    Jian, Tang

  • Author_Institution
    Department of Computer Science, Pennsylvania State University
  • Issue
    9
  • fYear
    1986
  • Firstpage
    847
  • Lastpage
    851
  • Abstract
    A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A technique to further accelerate this algorithm is also described.
  • Keywords
    Case analysis; NP-completeness; deterministic upper bound; maximum independent set; Acceleration; Algorithm design and analysis; Computer science; NP-complete problem; Polynomials; Upper bound; Case analysis; NP-completeness; deterministic upper bound; maximum independent set;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1986.1676847
  • Filename
    1676847
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1154374