Project information

Utilization of Structural and Width Parametres in Combinatorics and Algorithmic Complexity

Project Identification
GA201/08/0308
Project Period
1/2008 - 12/2010
Investor / Pogramme / Project type
Czech Science Foundation
MU Faculty or unit
Faculty of Informatics
Keywords
tree-width, fixed parameter algorithms, graph minors, graph searching, crossing number
Investor logo

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.

Results

Publications

2010

Previous 1 2 3 Next

You are running an old browser version. We recommend updating your browser to its latest version.

More info