All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Width Parameters Beyond Tree-width and Their Applications

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F07%3A00020090" target="_blank" >RIV/00216224:14330/07:00020090 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Width Parameters Beyond Tree-width and Their Applications

  • Original language description

    Besides the very successful concept of tree-width (see [H.~Bodlaender, A.~Koster: {Combinatorial optimisation on graphs of bounded treewidth}]), 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 (like matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract lev

  • Czech name

    Šířkové parametry po tree-width a jejich aplikace

  • Czech description

    Mnoho různých konceptů měření podobnosti struktur ke stromům bylo studováno od objevení tree-width. V tomto souhrnném článku ukazujeme nový moderní pohled na tyto koncepty a jak je lze využít v navrhování lepších parametrizovaných algoritmů.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F05%2F0050" target="_blank" >GA201/05/0050: Structural properties and algorithmic complexity of discrete problems</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computer Journal

  • ISSN

    0010-4620

  • e-ISSN

  • Volume of the periodical

    2007

  • Issue of the periodical within the volume

    online

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    37

  • Pages from-to

    1

  • UT code for WoS article

  • EID of the result in the Scopus database