Skip to main content
SpringerLink
Log in

Heuristic algorithm for finding the maximum independent set

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A heuristic algorithm is developed for finding the maximum independent set of vertices in an undirected graph. To this end, the technique of finite partially ordered sets is used, in particular, the technique of partitioning such a set into a minimum number of chains. A special digraph is constructed and a solution algorithm is proposed on the basis of a hypothesis about its properties. Some experimental data are presented for well-known examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  2. A Compendium of NP Optimization Problems, Royal Inst. of Technology, Stockholm (1998).

  3. M. N. S. Swamy and K. Thulasiraman, Graphs, Networks, and Algorithms [Russian translation], Mir, Moscow (1984).

    Google Scholar 

  4. D. B. West, Introduction to Graph Theory, Prentice Hall, Englewood Cliffs, NJ (1996).

    MATH  Google Scholar 

  5. E. M. Reingold, J. Nivergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice [Russian translation], Mir, Moscow (1980).

    Google Scholar 

  6. L. R. Jr. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], Mir, Moscow (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Volodymyr Dahl East Ukraine National University, Ministry of Education and Science, Youth and Sport of Ukraine, Lugansk, Ukraine

    A. D. Plotnikov

Authors
  1. A. D. Plotnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. D. Plotnikov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 41–48, September–October 2012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Plotnikov, A.D. Heuristic algorithm for finding the maximum independent set. Cybern Syst Anal 48, 673–680 (2012). https://doi.org/10.1007/s10559-012-9448-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-012-9448-1

Keywords

Search

Navigation