Publication detail

The Graph Isomorphism Problem

KŘENA, B.

Original Title

The Graph Isomorphism Problem

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

Graph, Isomorphism, Algorithm, Petri nets

Authors

KŘENA, B.

RIV year

2001

Released

19. 4. 2001

Publisher

Brno University of Technology

Location

Brno

ISBN

80-214-1860-5

Book

Proceedings of 7th Conference Student FEI 2001

Pages from

343

Pages to

347

Pages count

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"
}