Zapiski Nauchnykh Seminarov LOMI
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


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov LOMI, 1984, Volume 137, Pages 99–114 (Mi znsl4789)  
Polynomial isomorphism algorithm for graphs which are not contracted to $K_{3,g}$.

I. N. Ponomarenko
Full-text PDF (1042 kB)
Abstract: This paper describes polynomial-time algorithm which tests isomorphism of undirected graphs uncontracted to Bipartite complete graph $K_{3,g}$. The algorithm may be applied for graphs of bounded valence and for graphs with bounded genus within the same time. Construction of algorithm is based on properties of colour graphs from above class and on results of L. Babai and E. Luks about canonical forms for graphs.
Bibliographic databases:
Document Type: Article
UDC: 519.5
Language: Russian
Citation: I. N. Ponomarenko, “Polynomial isomorphism algorithm for graphs which are not contracted to $K_{3,g}$.”, Computational complexity theory. Part II, Zap. Nauchn. Sem. LOMI, 137, "Nauka", Leningrad. Otdel., Leningrad, 1984, 99–114
Citation in format AMSBIB
\Bibitem{Pon84}
\by I.~N.~Ponomarenko
\paper Polynomial isomorphism algorithm for graphs which are not contracted to~$K_{3,g}$.
\inbook Computational complexity theory. Part~II
\serial Zap. Nauchn. Sem. LOMI
\yr 1984
\vol 137
\pages 99--114
\publ "Nauka", Leningrad. Otdel.
\publaddr Leningrad
\mathnet{http://mi.mathnet.ru/znsl4789}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=762099}
\zmath{https://zbmath.org/?q=an:0551.68060}
Linking options:
  • https://www.mathnet.ru/eng/znsl4789
  • https://www.mathnet.ru/eng/znsl/v137/p99
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024