Implementation and optimization of a graph algorithm for computing rank-width – Bc. Miroslav Friedmanský
Bc. Miroslav Friedmanský
Master's thesis
Implementation and optimization of a graph algorithm for computing rank-width
Implementation and optimization of a graph algorithm for computing rank-width
Abstract:
Diplomová práca je zameraná na grafový parameter rank-width. Popisuje exponenciálny algoritmus na výpočet rank-width, jeho implementáciu a vylepšenia.Abstract:
The Master's thesis focuses on a graph parameter called rank-width. It describes an exponential time algorithm for computing rank-width, its implementation and improvements.
Language used: English
Date on which the thesis was submitted / produced: 5. 6. 2012
Identifier:
https://is.muni.cz/th/tgow6/
Thesis defence
- Date of defence: 26. 6. 2012
- Supervisor: RNDr. Robert Ganian
- Reader: prof. RNDr. Petr Hliněný, Ph.D.
Citation record
ISO 690-compliant citation record:
FRIEDMANSKÝ, Miroslav. \textit{Implementation and optimization of a graph algorithm for computing rank-width}. Online. Master's thesis. Brno: Masaryk University, Faculty of Informatics. 2012. Available from: https://theses.cz/id/1c6ljt/.
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 / Computer Networks and Communication
Theses on a related topic
-
Computational Aspects of Problems on Visibility and Disk Graph Representations
Onur Cagirici -
On k-thin and thin-strip graph classes
Tai Phat Pham -
Prostate Cancer Prediction with Graph Neural Networks
Štěpán Řihák -
Shader graph module for Age
Petr Babič -
Graph-based Anomaly Detection in Network Traffic
Denisa Šrámková