Now showing items 1-1 of 1

  • Designing Subexponential Algorithms: Problems, Techniques & Structures 

    Dorn, Frederic (The University of Bergen, 2007-09-14)
    In this thesis we focus on subexponential algorithms for NP-hard graph problems: exact and parameterized algorithms that have a truly subexponential running time behavior. For input instances of size n we study exact ...