Title
Speciální grafové, hypergrafové a algoritmické struktury
Code
GA201/98/1451
Summary
The project involves study selected graph, hypergraoh, algorithmic and data structures, using contemporary methods of discrete mathematics. The main goal is to obtain new results of basic research and to present them on an international level (publicatio ns in research journals, conference talks). We shall primarily deal with graph and hypergraph problems, with special regards to suitable models of interconnection networks and possible aplications, in particular, in parallel computing. We intend to inves tigate relationships between various (above mentioned and also other) classes of graphs (embeddability), to construct efficient algorithms for corresponding graph and hypergraph problems (including analysis of their complexity and the desing of appropria te data structures) and to study properties of various classes of combinatorial and algorithmic problems and their relationships.
Start year
1998
End year
2000
Provider
Grantová agentura ČR
Category
Obecná forma
Type
Standardní projekty
Solver
Information system of research, development and innovation (in Czech)