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, 2009, supplement № 1, Pages 96–98 (Mi pdm112)  
Applied Graph Theory

Graph recognition by moving agent

I. S. Grunskii, E. A. Tatarinov
Full-text PDF (378 kB)
References:
PDF
HTML
Abstract: A graph recognition problem is considered by means of agent which moves on graph edges, marks on its nodes and incidentors. A recognition method is proposed in which an agent builds not exploring graph. The method requires two different marks and one pebble, and its number of steps is cubic function from number of graph nodes.
Document Type: Article
UDC: 519.5
Language: Russian
Citation: I. S. Grunskii, E. A. Tatarinov, “Graph recognition by moving agent”, Prikl. Diskr. Mat., 2009, supplement № 1, 96–98
Citation in format AMSBIB
\Bibitem{GruTat09}
\by I.~S.~Grunskii, E.~A.~Tatarinov
\paper Graph recognition by moving agent
\jour Prikl. Diskr. Mat.
\yr 2009
\pages 96--98
\issueinfo supplement № 1
\mathnet{http://mi.mathnet.ru/pdm112}
Linking options:
  • https://www.mathnet.ru/eng/pdm112
  • https://www.mathnet.ru/eng/pdm/y2009/i10/p96
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:274
    Full-text PDF :121
    References:51
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024