| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Problem izomorfizma podgrafov ravninskih grafov
Authors:ID Kelenc, Aleksander (Author)
ID Taranenko, Andrej (Mentor) More about this mentor... New window
Files:.pdf MAG_Kelenc_Aleksander_2013.pdf (431,03 KB)
MD5: 3BBF6BD76DEE270E7AC8764700FAC2A9
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V problemu izomorfizma podgrafov imamo podana dva grafa G in H. Za njiju je potrebno ugotoviti, ali graf G vsebuje podgraf, ki je izomorfen grafu H. Problem je v splošnem NP-poln. V magistrskem delu se omejimo na problem izomorfizmov podgrafov ravninskih grafov. V prvem poglavju so opisani osnovni pojmi in definicije, ki jih potrebujemo v nadaljevanju. V drugem poglavju so najprej opisani drevesna dekompozicija, delni izomorfizem, meja delnega izomorfizma in konsistentnost. Potem je opisan postopek za učinkovito iskanje izomorfizmov podgrafov v ravninskih grafih z omejeno drevesno širino. Nadalje predstavimo, kako pokrijemo poljuben ravninski graf s podgrafi, ki imajo omejeno drevesno širino. Na koncu je podan algoritem za iskanje izomorfizmov podgrafov ravninskih grafov, ki teče v linearnem času za vsak povezan graf H z omejeno velikostjo.
Keywords:izomorfizem podgrafov, ravninski graf, drevesna dekompozicija, dinamično programiranje
Place of publishing:Maribor
Publisher:[A. Kelenc]
Year of publishing:2013
PID:20.500.12556/DKUM-41208 New window
UDC:519.172.2(043.2)
COBISS.SI-ID:20051208 New window
NUK URN:URN:SI:UM:DK:SCY8EUV9
Publication date in DKUM:19.09.2013
Views:3071
Downloads:258
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Subgraph isomorphism problem in planar graphs
Abstract:In the subgraph isomorphism problem two graphs G and H are given as input. We must determine whether G contains a subgraph isomorphic to H. In general, the problem is NP-complete. In this thesis we present a linear algorithm for the subgraph isomorphism problem in planar graphs. The first section describes the basic concepts and definitions. The second chapter describes the tree decomposition, partial isomorphism, partial isomorphism boundary and consistency. Then it describes how to efficiently search for subgraph isomorphisms in planar graphs with bounded tree-width. Furthermore, we present how to cover any planar graph with subgraphs that have bounded tree-width. At the end, we present an algorithm for subgraph isomorphism problem in planar graphs, which runs in linear time for any connected graph H of a constant size.
Keywords:subgraph isomorphism, planar graph, tree decomposition, dynamic programming


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica