English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Dynamic algorithms for graphs of bounded treewidth

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hagerup, Torben1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517914
Other: Local-ID: C1256428004B93B8-79FE497977EEBAC2C12565D7004AC243-Hagerup97a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Bologna, Italy
Start-/End Date: 1997

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97)
Source Genre: Proceedings
 Creator(s):
Degano, Pierpaolo, Editor
Gorrieri, Roberto, Editor
Marchetti-Spaccamela, Alberto, Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 292 - 302 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1256 Sequence Number: - Start / End Page: - Identifier: -