Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251)

Authors Andreas Brandstädt, Jeremy P. Spinrad



PDF
Thumbnail PDF

File

DagSemRep.312.pdf
  • Filesize: 3.16 MB
  • 20 pages

Document Identifiers

Author Details

Andreas Brandstädt
Jeremy P. Spinrad

Cite As Get BibTex

Andreas Brandstädt and Jeremy P. Spinrad. Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251). Dagstuhl Seminar Report 312, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2002) https://doi.org/10.4230/DagSemRep.312

Metrics

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

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail