Return to search

Zjišťování izomorfizmu grafů v databázi / Graph Isomorphism Problem in Databases

This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism. It describes possible ways to find graph isomorphism and chosen algorithms for subgraph and graph isomorphism. The experimental part aims to comparing two implemented algorithms. These are Ullmann and VF2 algorithm. Also searches difference between graphs stored in memory and graphs stored in database.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236007
Date January 2008
CreatorsStejskal, Roman
ContributorsJirák, Ota, Chmelař, Petr
PublisherVysoké učení technické v Brně. Fakulta informačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.112 seconds