Isomorphism problem for geometric intersection graphs – Bc. Deniz Agaoglu, B.Sc.
Bc. Deniz Agaoglu, B.Sc.
Master's thesis
Isomorphism problem for geometric intersection graphs
Isomorphism problem for geometric intersection graphs
Abstract:
Graph Isomorphism Problem is one of the well-known problems in graph theory. Although it is not known whether it belongs to P or not, it has been shown to be solvable in polynomial and even in linear time for various graph classes. In particular, the isomorphism problem is solvable in polynomial-time for interval graphs and it is as hard as on all graphs for chordal graphs (i.e., GI-complete). Our …more
Language used: English
Date on which the thesis was submitted / produced: 21. 5. 2018
Identifier:
https://is.muni.cz/th/lburv/
Thesis defence
- Date of defence: 22. 6. 2018
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: Dr. rer. nat. Achim Blumensath
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsMaster programme / field:
Informatics / Information Technology Security (eng.)
Theses on a related topic
-
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu Cagirici -
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu -
Structural and geometric graph theory and algorithmic metatheorems
Filip Pokrývka -
Limits of efficient FO model checking of geometric graphs
Filip Pokrývka