Blar i Bergen Open Research Archive på forfatter "Strømme, Torstein Jarl Fagerbakke"

Viser treff 1-4 av 4

    • Exploiting graph structures for computational efficiency 

      Strømme, Torstein Jarl Fagerbakke (Doctoral thesis, 2020-05-07)
      Coping with NP-hard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph ...

    • Kernelization of Vertex Cover by Structural Parameters 

      Strømme, Torstein Jarl Fagerbakke (Master thesis, 2015-08-03)
      In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in ...

    • Mandatory or Voluntary Course Work in Introductory Programming Courses? 

      Bolland, Sondre Sæther; Eide, Tyra Fosheim; Strømme, Torstein Jarl Fagerbakke (Journal article; Peer reviewed, 2023)
      Which approach, mandatory or voluntary weekly labs, is more conducive to student learning? We conducted a quasi-experiment in a bachelor level programming course (CS2) at the Department of Informatics at the University of ...

    • Mim-Width III. Graph powers and generalized distance domination problems 

      Telle, Jan Arne; Jaffke, Lars; Strømme, Torstein Jarl Fagerbakke; Kwon, O-Joung (Peer reviewed; Journal article, 2019)
      We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent ...