Dynamic algorithms for graphs of bounded treewidth

Hagerup, Torben

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dynamic algorithms for graphs of bounded treewidth

MPS-Authors

/persons/resource/persons44564

Hagerup, Torben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Hagerup, T. (1997). Dynamic algorithms for graphs of bounded treewidth. In P. Degano, R. Gorrieri, & A. Marchetti-Spaccamela (Eds.), Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97) (pp. 292-302). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3920-6

Abstract

There is no abstract available