Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems

Nina Sofia Taslaman

    Research output: Book / Anthology / Report / Ph.D. thesis › Ph.D. thesis

    Fingerprint

    Dive into the research topics of 'Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems'. Together they form a unique fingerprint.

    Mathematics