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

Nina Sofia Taslaman

    Research output: ThesesPhD thesis

    Fingerprint

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

    Keyphrases

    Mathematics