Result Details

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.
Type
conference paper
Language
English
Authors
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

URL
Published
2001
Pages
343–347
Proceedings
Proceedings of 7th Conference Student FEI 2001
Conference
Konference a soutěž STUDENT FEI 2001
ISBN
80-214-1860-5
Publisher
Brno University of Technology
Place
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"
}
Projects
Modelling, Verifying, and Prototyping Distributed Applications Using Petri Nets, GACR, Standardní projekty, GA102/00/1017, start: 2000-01-01, end: 2002-12-31, completed
PNtalk - tools based on object-oriented Petri nets, BUT, Institucionální podpora na rozvoj výzkumné organizace, UIVT-PNtalk, start: 1994-01-01, end: 2010-12-31, completed
Research groups
Departments
Back to top