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

Nina Sofia Taslaman

    Publikation: Bog / Antologi / Rapport / Ph.D.-afhandling › Ph.d.-afhandling

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems'. Sammen danner de et unikt fingeraftryk.

    Matematik