Skip Navigation


The Computer Journal Advance Access originally published online on September 6, 2007
The Computer Journal 2008 51(3):326-362; doi:10.1093/comjnl/bxm052
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
51/3/326    most recent
bxm052v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hlineny, P.
Right arrow Articles by Gottlob, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Width Parameters Beyond Tree-width and their Applications

Petr Hlineny1,2,*, Sang-il Oum3 7, Detlef Seese4 and Georg Gottlob5,6

1 Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic
2 VSB, Technical University of Ostrava, Ostrava, Czech Republic
3 School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA
4 Institute AIFB, University Karlsruhe (TH), D-76128 Karlsruhe, Germany
5 Oxford University Computing Laboratory, Parks Road, Oxford OX1 3QD, UK
6 Vienna University of Technology, Vienna, Austria

* Corresponding author: hlineny{at}fi.muni.cz

Received 30 July 2006; revised 20 December 2006

Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ‘width’ parameters in combinatorial structures delivers—besides traditional tree-width and derived dynamic programming schemes—also a number of other useful parameters like branch-width, rank-width (clique-width) or hypertree-width. In this contribution, we demonstrate how ‘width’ parameters of graphs and generalized structures (such as matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level.

Key Words: graph • complexity • tree-width • branch-width • clique-width • rank-width • hypertree-width • MSO logic

7 Present address: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.