Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Zametki, 2010, Volume 88, Issue 5, Pages 643–650
DOI: https://doi.org/10.4213/mzm8403 (Mi mzm8403) 		 
This article is cited in 33 scientific papers (total in 33 papers)

On the Complexity of Some Problems Related to Graph Extensions

M. B. Abrosimov

Saratov State University named after N. G. Chernyshevsky
Full-text PDF (412 kB) Citations (33)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm8403
Abstract: The computational complexity of problems related to the construction of $k$-extensions of graphs is studied. It is proved that the problems of recognizing vertex and edge $k$-extensions are NP-complete. The complexity of recognizing irreducible, minimal, and exact vertex and edge $k$-extensions is considered.
Keywords: extension of graphs, vertex and edge $k$-extension, minimal $k$-extension, irreducible $k$-extension, exact $k$-extension, NP problem, NP-complete problem, fault tolerance.
Received: 10.01.2009
Revised: 13.02.2010
English version:
Mathematical Notes, 2010, Volume 88, Issue 5, Pages 619–625
DOI: https://doi.org/10.1134/S0001434610110015
Bibliographic databases:
Document Type: Article
UDC: 519.17
Language: Russian
Citation: M. B. Abrosimov, “On the Complexity of Some Problems Related to Graph Extensions”, Mat. Zametki, 88:5 (2010), 643–650; Math. Notes, 88:5 (2010), 619–625
Citation in format AMSBIB
\Bibitem{Abr10}
\by M.~B.~Abrosimov
\paper On the Complexity of Some Problems Related to Graph Extensions
\jour Mat. Zametki
\yr 2010
\vol 88
\issue 5
\pages 643--650
\mathnet{http://mi.mathnet.ru/mzm8403}
\crossref{https://doi.org/10.4213/mzm8403}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2868388}
\transl
\jour Math. Notes
\yr 2010
\vol 88
\issue 5
\pages 619--625
\crossref{https://doi.org/10.1134/S0001434610110015}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000288489700001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-78651238050}
Linking options:
  • https://www.mathnet.ru/eng/mzm8403
  • https://doi.org/10.4213/mzm8403
  • https://www.mathnet.ru/eng/mzm/v88/i5/p643
    • This publication is cited in the following 33 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:500
    Full-text PDF :199
    References:49
    First page:23
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024