Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 97–98 (Mi pdm215)  
Applied Theory of Coding, Automata and Graphs

On a new complete invariant for acyclic graphs

A. V. Prolubnikov

Omsk State University, Omsk
Full-text PDF (327 kB)
References:
PDF
HTML
Abstract: A new complete invariant for acyclic graphs is presented. An algorithm for solution of the graph isomorphism problem is considered. The algorithm is based on the invariant and gives solution of the problem for a wide graph class.
Document Type: Article
UDC: 519.175.1
Language: Russian
Citation: A. V. Prolubnikov, “On a new complete invariant for acyclic graphs”, Prikl. Diskr. Mat., 2010, supplement № 3, 97–98
Citation in format AMSBIB
\Bibitem{Pro10}
\by A.~V.~Prolubnikov
\paper On a~new complete invariant for acyclic graphs
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 97--98
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm215}
Linking options:
  • https://www.mathnet.ru/eng/pdm215
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p97
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:179
    Full-text PDF :88
    References:21
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024