09491 Abstracts Collection – Graph Search Engineering

Authors Lubos Brim, Stefan Edelkamp, Eric A. Hansen, Peter Sanders

Thumbnail PDF


  • Filesize: 355 kB
  • 31 pages

Document Identifiers

Author Details

Lubos Brim
Stefan Edelkamp
Eric A. Hansen
Peter Sanders

Cite AsGet BibTex

Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders. 09491 Abstracts Collection – Graph Search Engineering. In Graph Search Engineering. Dagstuhl Seminar Proceedings, Volume 9491, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


From the 29th November to the 4th December 2009, the Dagstuhl Seminar 09491 ``Graph Search Engineering '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. 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.
  • Model Checking
  • Artificial Intelligence
  • AI Planning
  • State Explosion Problem
  • Error Detection
  • Protocol Analysis
  • Software Verification and Validation
  • Heuristics
  • Pattern/Abstraction Databases
  • I/O Efficient Search
  • Solid State Disks
  • GPU


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail