Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Source
Material
Years
Person/Organisation
Keywords
Language
  • 1
    Book
    Book
    Exact Exponential Algorithms / (2010)
    Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,
    Details
    Title: Exact Exponential Algorithms /
    Author: Fomin, Fedor V.
    Contributer: Kratsch, Dieter
    Publisher: Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,
    Year of publication: 2010
    Pages: XIII, 203 S.
    Series Statement: Texts in Theoretical Computer Science. An EATCS Series
    ISBN: 978-3-642-16533-7 , 978-3-642-16532-0
    Type of Medium: Book
    Language: English
    URL: http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:pre05817382&format=complete
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    facet.materialart.
    Unknown
    On exact algorithms for treewidth (2006)
    Details
    Publication Date: 2014-11-10
    Description: We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time $O^\ast(2^n)$. This algorithm is based on the old dynamic programming method introduced by Held and Karp for the {\sc Tra veling Salesman} problem. We use some optimizations that do not affect the worst case running time but improve on the running time on actual instances and can be seen to be practical for small instances. However, our experiments show that the space use d by the algorithm is an important factor to what input sizes the algorithm is effective. For this purpose, we settle the problem of computing treewidth under the restriction that the space used is only polynomial. In this direction we give a simple $O^\ast(4^n)$ al gorithm that requires {\em polynomial} space. We also show that with a more complicated algorithm, using balanced separators, {\sc Treewidth} can be computed in $O^\ast(2.9512^n)$ time and polynomial space.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...