Detail publikace

The Graph Isomorphism Problem

KŘENA, B. The Graph Isomorphism Problem. Proceedings of 7th Conference Student FEI 2001. Brno: Brno University of Technology, 2001. p. 343-347. ISBN: 80-214-1860-5.
Název česky
Problém izomorfizmu grafů
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Křena Bohuslav, Ing., Ph.D. (UITS)
URL
Klíčová slova

Graph, Isomorphism, Algorithm, Petri nets

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.

Rok
2001
Strany
343–347
Sborník
Proceedings of 7th Conference Student FEI 2001
ISBN
80-214-1860-5
Vydavatel
Brno University of Technology
Místo
Brno
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"
}
Nahoru