Jump to ContentJump to Main Navigation
Invitation to Fixed-Parameter Algorithms$
Users without a subscription are not able to see the full content.

Rolf Niedermeier

Print publication date: 2006

Print ISBN-13: 9780198566076

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198566076.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 23 May 2019

TREE DECOMPOSITIONS OF GRAPHS

TREE DECOMPOSITIONS OF GRAPHS

Chapter:
(p.150) 10 TREE DECOMPOSITIONS OF GRAPHS
Source:
Invitation to Fixed-Parameter Algorithms
Author(s):

Rolf Niedermeier

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198566076.003.0010

This chapter provides an introduction to tree decomposition and treewidth, important concepts from modern graph theory. Treewidth is one of the best studied and most significant structural parameters. The construction of tree decompositions is briefly discussed, followed by special considerations applying to planar graphs. The main focus of the chapter is on dynamic programming on tree decompositions, here demonstrated for the problems Vertex Cover and Dominating Set. The chapter closes by sketching the relationship to monadic second-order logic and some related graph width parameters.

Keywords:   tree width, planar graph, dynamic programming, monadic second-order logic, graph width parameter

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .