> Details

Brandstädt, Andreas [Author]; Corneil, Derek G. [Author]; Jansen, Klaus [Author]; Spinrad, Jeremy P. [Author] ; Andreas Brandstädt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad [Contributor]

04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: 04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes
  • Contributor: Brandstädt, Andreas [Author]; Corneil, Derek G. [Author]; Jansen, Klaus [Author]; Spinrad, Jeremy P. [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2005
  • Language: English
  • DOI: https://doi.org/10.4230/DagSemProc.04221.1
  • Keywords: graph classes ; Graph algorithms ; robust algorithms ; approximation
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: From 23.05.04 to 28.05.04, the Dagstuhl Seminar 04221 ``Robust and Approximative Algorithms on Particular Graph Classes'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
  • Access State: Open Access