• Skip the Organizational structure panel
• Organizational structure

  On selecting a constituent part of MU the "List of projects" page will be displayed with information relevant to the selected constituent part. The "List of projects" page is not available for non-activated items.

  Masaryk University

  • Faculties
  • Law
  • Medicine
  • Science
  • Arts
  • Education
  • Economics
  • Informatics
  • Social Studies
  • Sports Studies

  • Rector`s Office
  • Rectorate
  • Institutes
  • Computer Science
  • CEITEC MU
  • Specialized Units
  • Hostels & Canteens
  • University Press
  • UCB Management

  • Other Units
  • Archive
  • Language Centre
  • International Studies
  • Disabled Students
  • Technology Transfer Office
  • Biostatistics
  • Mendel Museum
  • CERIT
  • CEITEC Central Management
  • Telč Centre

   

Project details

Utilization of Structural and Width Parametres in Combinatorics and Algorithmic Complexity

Project Identification:	GA201/08/0308
Project Period:	1/2008 - 12/2010
Investor:	Czech Science Foundation
Programme / Project Type:	Standard Projects -
MU Faculty/Unit:	Faculty of Informatics MU Investigator: Assoc. Prof. RNDr. Petr Hliněný, Ph.D.
Field:	BA - General mathematics (B - Physics and mathematics) IN - Informatics (I - Informatics)
Publications/Results:	more
Keywords:	tree-width, fixed parameter algorithms, graph minors, graph searching, crossing number

Many practical algorithmic problems have a core based on combinatorial structures, such as graphs, digraphs, or matroids. Although it is typically infeasible to give general algorithmic solutions of (majority of) these problems, it is often the case that such hard problems are indeed efficiently solvable for all inputs of certain internal stucture like those having bounded width.