The Graph Isomorphism Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU28662" target="_blank" >RIV/00216305:26220/01:PU28662 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Graph Isomorphism Problem
Original language description
The graph isomorphism problem is very simple to define and understand. There also exists some easy to describe algorithms that solve this problem, but these algorithms have a huge time complexity. Efficiency (time complexity) of all practically usable graph isomorphism algorithms is the main issue of the graph isomorphism problem. In this paper, we show several graph isomorphism algorithms and, at the end of the paper, we discuss graph isomorphism problem in the context of object-oriented Petri nets, whhich are a subject of our research.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F00%2F1017" target="_blank" >GA102/00/1017: Modelling, verifying and prototyping distributed applications using Petri nets</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 7th Conference Student FEI 2001
ISBN
80-214-1860-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
343-347
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Brno
Event date
Apr 3, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—