Show simple item record

dc.contributor.authorSasák, Róberteng
dc.date.accessioned2010-12-02T12:10:41Z
dc.date.available2010-12-02T12:10:41Z
dc.date.issued2010-08-02eng
dc.date.submitted2010-08-02eng
dc.identifier.urihttp://hdl.handle.net/1956/4329
dc.description.abstractMany parametrized problems were decided to be FPT or W-hard. However, there is still thousands of problems and parameters for which we do not know yet whether are FPT or W-hard. In this thesis, we provide a tool for extending existing results to additional parametrized problems. We use the comparison relation for comparing graph parameters, i.e. we say that parameter p1 is bounded by parameter p2 if exists a function f that for every graph G holds p1(G)<=f(p2(G)). This allows us to extend results for parametrized problem P in two ways. If problem P parametrized by p1 is FPT then also P parametrized by p2 is FPT. Or wise-versa, if problem P parametrized by p2 is W-hard then also P parametrized by p1 is W-hard. Moreover, we show whether is a parameter bounded by another parameter for the 17 graph parameters: path-width, tree-width, branch-width, clique-width, rank-width, boolean-width, maximum independent set, minimum dominating set, vertex cover number, maximum clique, chromatic number, maximum matching, maximum induced matching, cut-width, carving-width, degeneracy and tree-depth. To avoid all 272 different comparisons, we introduce methodology for examining graph parameters which rapidly reduce number of comparisons. And finally, we provide comparison diagram for all 17 parameters.en
dc.format.extent745190 byteseng
dc.format.mimetypeapplication/pdfeng
dc.language.isoengeng
dc.publisherThe University of Bergeneng
dc.titleComparing 17 graph parameterseng
dc.typeMaster thesiseng
dc.type.degreeMaster i Informatikknob
dc.type.courseINF399eng
dc.subject.nsiVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420nob
dc.subject.archivecodeMastergradeng
dc.subject.nus754199eng
dc.type.programMAMN-INFeng
dc.rights.holderCopyright the author. All rights reserved
dc.rights.holderThe authoreng


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record