Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1999, Volume 6, Issue 4, Pages 3–19 (Mi da324)  
This article is cited in 27 scientific papers (total in 27 papers)

A polynomial algorithm for finding the largest independent sets in claw-free graphs

V. E. Alekseev

N. I. Lobachevski State University of Nizhni Novgorod
Full-text PDF (2217 kB) Citations (27)
Received: 14.01.1999
Revised: 19.07.1999
Bibliographic databases:
UDC: 519.17
Language: Russian
Citation: V. E. Alekseev, “A polynomial algorithm for finding the largest independent sets in claw-free graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 3–19
Citation in format AMSBIB
\Bibitem{Ale99}
\by V.~E.~Alekseev
\paper A~polynomial algorithm for finding the largest independent sets in claw-free graphs
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1999
\vol 6
\issue 4
\pages 3--19
\mathnet{http://mi.mathnet.ru/da324}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1760726}
\zmath{https://zbmath.org/?q=an:0931.05078}
Linking options:
  • https://www.mathnet.ru/eng/da324
  • https://www.mathnet.ru/eng/da/v6/s1/i4/p3
    • This publication is cited in the following 27 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:704
    Full-text PDF :287
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024