Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 99231)

Brandstädt, Andreas; Olariu, Stephan; Spinrad, Jeremy P.

doi:10.4230/DagSemRep.241

Document

Graph Decompositions and Algorithmic Applications (Dagstuhl Seminar 99231)

Authors Andreas Brandstädt, Stephan Olariu, 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: 1999-08-23

PDF

File

DagSemRep.241.pdf

Filesize: 187 kB
20 pages

Document Identifiers

DOI: 10.4230/DagSemRep.241
URN: urn:nbn:de:0030-drops-151276

Author Details

Andreas Brandstädt

Stephan Olariu

Jeremy P. Spinrad

Cite As Get BibTex

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

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