Dagstuhl Seminar Proceedings 07211

Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes

A. Brandstädt, K. Jansen, D. Kratsch, J. P. Spinrad (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 07211, 20.05. - 25.05.2007
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Brandstädt, Andreas
  • de Ridder, H.N.
  • Jansen, Klaus
  • Kratsch, Dieter
  • Le, Van Bang
  • Spinrad, Jeremy P.
    		•

    		  
    07211 Abstracts Collection -- Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes
    Authors: Brandstädt, Andreas ; Jansen, Klaus ; Kratsch, Dieter ; Spinrad, Jeremy P.

    Abstract | Document (224 KB) | BibTeX

    Linear-time certifying recognition for partitioned probe cographs
    Authors: Le, Van Bang ; de Ridder, H.N.

    Abstract | Document (108 KB) | BibTeX

    		  



    DROPS-Home | Imprint | Privacy
    Published by LZI