Zpět na vyhledávání

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.
 

Keywords

rank-width graph algorithm implementation fast subset convolution
 
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

Cite this text

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 informatiky
Složka Reference to the local database directory of the institution