Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1994, Volume 34, Number 8-9, Pages 1272–1292 (Mi zvmmf2521)  
Methods of finding all minimum coverings of a graph by cliques

E. V. Bratceva, V. P. Cherenin

Moscow
Full-text PDF (2491 kB)
References:
PDF
HTML
Received: 18.01.1993
Revised: 04.11.1993
Bibliographic databases:
Document Type: Article
UDC: 519.176
MSC: 68R10
Language: Russian
Citation: E. V. Bratceva, V. P. Cherenin, “Methods of finding all minimum coverings of a graph by cliques”, Zh. Vychisl. Mat. Mat. Fiz., 34:8-9 (1994), 1272–1292; Comput. Math. Math. Phys., 34:8-9 (1994), 1103–1118
Citation in format AMSBIB
\Bibitem{BraChe94}
\by E.~V.~Bratceva, V.~P.~Cherenin
\paper Methods of finding all minimum coverings of a graph by cliques
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 1994
\vol 34
\issue 8-9
\pages 1272--1292
\mathnet{http://mi.mathnet.ru/zvmmf2521}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1300398}
\zmath{https://zbmath.org/?q=an:0835.68088}
\transl
\jour Comput. Math. Math. Phys.
\yr 1994
\vol 34
\issue 8-9
\pages 1103--1118
Linking options:
  • https://www.mathnet.ru/eng/zvmmf2521
  • https://www.mathnet.ru/eng/zvmmf/v34/i8/p1272
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025