Dagstuhl Seminar Proceedings 10441

Exact Complexity of NP-hard Problems

T. Husfeldt, D. Kratsch, R. Paturi, G. B. Sorkin (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 10441, 31.10. - 05.11.2010
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Eppstein, David
  • Husfeldt, Thore
  • Kratsch, Dieter
  • Löffler, Maarten
  • Paturi, Ramamohan
  • Sorkin, Gregory B.
  • Strash, Darren
    		•

    		  
    10441 Abstracts Collection -- Exact Complexity of NP-hard Problems
    Authors: Husfeldt, Thore ; Kratsch, Dieter ; Paturi, Ramamohan ; Sorkin, Gregory B.

    Abstract | Document (586 KB) | BibTeX

    Listing all maximal cliques in sparse graphs in near-optimal time
    Authors: Eppstein, David ; Löffler, Maarten ; Strash, Darren

    Abstract | Document (406 KB) | BibTeX

    		  



    DROPS-Home | Imprint | Privacy
    Published by LZI