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
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
Keywords
Access
  • 1
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg : Springer Berlin Heidelberg
    Details
    UID:
    gbv_1649309511
    Format: Online-Ressource
    ISBN: 9783540486725
    Series Statement: Lecture Notes in Computer Science 842
    Additional Edition: ISBN 9783540583561
    Additional Edition: Buchausg. u.d.T. Kloks, Ton Treewidth Berlin : Springer, 1994 ISBN 3540583564
    Additional Edition: ISBN 0387583564
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    ST 134
    RVK:
    SK 890
    RVK:
    SS 4800
    Keywords: Baum
    DOI: 10.1007/BFb0045375
    URL: Volltext
    URL: Cover
    URL: Inhaltstext
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: lizenzpflichtig
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
  • 2
    Book
    Book
    Treewidth : computations and approximations (1994)
    Berlin : Springer
    Details
    UID:
    gbv_272035394
    Format: IX, 209 S. , graph. Darst.
    ISBN: 3540583564 , 0387583564
    Series Statement: Lecture notes in computer science 842
    Note: Vollst. zugl.: Utrecht, Rijksuniv., Diss., 1993 , Literaturverz. S. [193] - 206
    Additional Edition: Erscheint auch als Online-Ausgabe Kloks, Ton Treewidth Berlin, Heidelberg : Springer Berlin Heidelberg, 1994 ISBN 9783540486725
    Additional Edition: Erscheint auch als Online-Ausgabe Kloks, Ton Treewidth Berlin [u.a.] : Springer, 1994 ISBN 9783540486725
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    SS 4800
    RVK:
    ST 134
    RVK:
    SK 890
    Keywords: Baum ; Baum ; Hochschulschrift
    URL: Cover
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    URL: http://www.loc.gov/catdir/enhancements/fy0815/94031558-d.html
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
  • 3
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920888402882
    Format: X, 218 p. , online resource.
    ISBN: 9783540486725
    Series Statement: Lecture Notes in Computer Science, 842
    Content: This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
    Note: and basic terminology -- Preliminaries -- Testing superperfection of k-trees -- Triangulating 3-colored graphs -- Only few graphs have bounded treewidth -- Approximating treewidth and pathwidth of a graph -- Approximating treewidth and pathwidth for some classes of perfect graphs -- Treewidth of chordal bipartite graphs -- Treewidth and pathwidth of permutation graphs -- Treewidth of circle graphs -- Finding all minimal separators of a graph -- Treewidth and pathwidth of cocomparability graphs of bounded dimension -- Pathwidth of pathwidth-bounded graphs -- Treewidth of treewidth-bounded graphs -- Recognizing treewidth-bounded graphs.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540583561
    Language: English
    DOI: 10.1007/BFb0045375
    URL: http://dx.doi.org/10.1007/BFb0045375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 4
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621102702882
    Format: X, 218 p. , online resource.
    Edition: 1st ed. 1994.
    ISBN: 9783540486725
    Series Statement: Lecture Notes in Computer Science, 842
    Content: This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
    Note: and basic terminology -- Preliminaries -- Testing superperfection of k-trees -- Triangulating 3-colored graphs -- Only few graphs have bounded treewidth -- Approximating treewidth and pathwidth of a graph -- Approximating treewidth and pathwidth for some classes of perfect graphs -- Treewidth of chordal bipartite graphs -- Treewidth and pathwidth of permutation graphs -- Treewidth of circle graphs -- Finding all minimal separators of a graph -- Treewidth and pathwidth of cocomparability graphs of bounded dimension -- Pathwidth of pathwidth-bounded graphs -- Treewidth of treewidth-bounded graphs -- Recognizing treewidth-bounded graphs.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662164228
    Additional Edition: Printed edition: ISBN 9783540583561
    Language: English
    DOI: 10.1007/BFb0045375
    URL: https://doi.org/10.1007/BFb0045375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 5
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186343602883
    Format: 1 online resource (X, 218 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48672-0
    Series Statement: Lecture Notes in Computer Science, 842
    Content: This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
    Note: Bibliographic Level Mode of Issuance: Monograph , and basic terminology -- Preliminaries -- Testing superperfection of k-trees -- Triangulating 3-colored graphs -- Only few graphs have bounded treewidth -- Approximating treewidth and pathwidth of a graph -- Approximating treewidth and pathwidth for some classes of perfect graphs -- Treewidth of chordal bipartite graphs -- Treewidth and pathwidth of permutation graphs -- Treewidth of circle graphs -- Finding all minimal separators of a graph -- Treewidth and pathwidth of cocomparability graphs of bounded dimension -- Pathwidth of pathwidth-bounded graphs -- Treewidth of treewidth-bounded graphs -- Recognizing treewidth-bounded graphs. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58356-4
    Language: English
    DOI: 10.1007/BFb0045375
    URL: http://dx.doi.org/10.1007/BFb0045375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
  • 6
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186343602883
    Format: 1 online resource (X, 218 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48672-0
    Series Statement: Lecture Notes in Computer Science, 842
    Content: This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
    Note: Bibliographic Level Mode of Issuance: Monograph , and basic terminology -- Preliminaries -- Testing superperfection of k-trees -- Triangulating 3-colored graphs -- Only few graphs have bounded treewidth -- Approximating treewidth and pathwidth of a graph -- Approximating treewidth and pathwidth for some classes of perfect graphs -- Treewidth of chordal bipartite graphs -- Treewidth and pathwidth of permutation graphs -- Treewidth of circle graphs -- Finding all minimal separators of a graph -- Treewidth and pathwidth of cocomparability graphs of bounded dimension -- Pathwidth of pathwidth-bounded graphs -- Treewidth of treewidth-bounded graphs -- Recognizing treewidth-bounded graphs. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58356-4
    Language: English
    DOI: 10.1007/BFb0045375
    URL: http://dx.doi.org/10.1007/BFb0045375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 7
    Online Resource
    Online Resource
    Treewidth : Computations and Approximations (1994)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186343602883
    Format: 1 online resource (X, 218 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48672-0
    Series Statement: Lecture Notes in Computer Science, 842
    Content: This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.
    Note: Bibliographic Level Mode of Issuance: Monograph , and basic terminology -- Preliminaries -- Testing superperfection of k-trees -- Triangulating 3-colored graphs -- Only few graphs have bounded treewidth -- Approximating treewidth and pathwidth of a graph -- Approximating treewidth and pathwidth for some classes of perfect graphs -- Treewidth of chordal bipartite graphs -- Treewidth and pathwidth of permutation graphs -- Treewidth of circle graphs -- Finding all minimal separators of a graph -- Treewidth and pathwidth of cocomparability graphs of bounded dimension -- Pathwidth of pathwidth-bounded graphs -- Treewidth of treewidth-bounded graphs -- Recognizing treewidth-bounded graphs. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58356-4
    Language: English
    DOI: 10.1007/BFb0045375
    URL: http://dx.doi.org/10.1007/BFb0045375
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540486275?
Did you mean 9783540087625?
Did you mean 9783540286325?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages