Detail publikace

The Graph Isomorphism Problem

KŘENA, B.

Originální název

The Graph Isomorphism Problem

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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, which are a subject of our research.

Klíčová slova

Graph, Isomorphism, Algorithm, Petri nets

Autoři

KŘENA, B.

Rok RIV

2001

Vydáno

19. 4. 2001

Nakladatel

Brno University of Technology

Místo

Brno

ISBN

80-214-1860-5

Kniha

Proceedings of 7th Conference Student FEI 2001

Strany od

343

Strany do

347

Strany počet

5

URL

http://www.fit.vutbr.cz/~krena/prace/stc2001.pdf

BibTex

@inproceedings{BUT5443,
  author="Bohuslav {Křena}",
  title="The Graph Isomorphism Problem",
  booktitle="Proceedings of 7th Conference Student FEI 2001",
  year="2001",
  pages="343--347",
  publisher="Brno University of Technology",
  address="Brno",
  isbn="80-214-1860-5",
  url="http://www.fit.vutbr.cz/~krena/prace/stc2001.pdf"
}