Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251)

Brandstädt, Andreas; Spinrad, Jeremy P.

doi:10.4230/DagSemRep.312

Document

Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 01251)

Authors Andreas Brandstädt, Jeremy P. Spinrad

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2002-01-24

PDF

File

DagSemRep.312.pdf

Filesize: 3.16 MB
20 pages

Document Identifiers

DOI: 10.4230/DagSemRep.312
URN: urn:nbn:de:0030-drops-151962

Author Details

Andreas Brandstädt

Jeremy P. Spinrad

Cite AsGet 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

0

Metadata Views

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