Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A method of determining graph isomorphism

From MaRDI portal
Publication:3670593
Jump to:navigation, search

DOI10.1007/BF01074524zbMATH Open0521.68076MaRDI QIDQ3670593FDOQ3670593


Authors: V. K. Pogrebnoj Edit this on Wikidata


Publication date: 1982

Published in: Cybernetics (Search for Journal in Brave)






zbMATH Keywords

graph isomorphismintegral characteristicslocal characteristics


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)


Cites Work

  • An Efficient Algorithm for Graph Isomorphism
  • Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
  • Remarks on the theory of graph characteristics
  • Title not available (Why is that?)
  • Title not available (Why is that?)






This page was built for publication: A method of determining graph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670593)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3670593&oldid=17135621"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 07:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki