View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        A simulated annealing method for computing rank-width

        Thumbnail
        View/Open
        Florian Nouwt - A simulated annealing method for computing rank-width [Final Version] [Revision 2].pdf (1013.Kb)
        Publication date
        2022
        Author
        Nouwt, Florian
        Metadata
        Show full item record
        Summary
        In this thesis we show that simulated annealing is a very viable heuristic method for approximating rank-width and other branch-decomposition based width parameters. We present the various aspects of the algorithm in detail and discuss the design choices that were made with the help of practical experiments. Finally, extensive benchmarks were performed to assess the performance of the algorithm. We improved many of the currently best known rank-width upper bounds and show the first practical results for F4-rank-width and maximum matching-width.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/41566
        Collections
        • Theses

        Related items

        Showing items related by title, author, creator and subject.

        • Morphodynamic equilibrium of width and bed level profile of an estuary in response to adjustable channel widths 

          Janssen, Michal (2022)
          In this thesis, the morphodynamic equilibrium of the width and bed level profile of estuaries is studied. This is done by using an one-dimensional hydrodynamic and morphodynamic model that includes variable channel widths. ...
        • The Algorithmic Complexity of Tree-Clique Width 

          Aronis, Chris (2021)
          Tree-width has been proven to be a useful parameter to design fast and efficient algorithms for intractable problems. However, while tree-width is low on relatively sparse graphs can be arbitrary high on dense graphs. ...
        • Variations on Boolean-width 

          Brinke, C.B. ten (2015)
          This thesis is about the graph parameter boolean-width and several related parameters. In particular we investigate the restriction of boolean-width to linear decompositions, called linear boolean-width. Improving upon ...
        Utrecht university logo