Projects funded by the NCN
Coloring games on graphs and partially ordered sets
2011/03/B/ST6/01367
Keywords:
poset on-line algorithm First-Fit coloring comparability graph Dilworth's theorem Ramsey's theorem
Descriptors:
- ST6_7: Artificial intelligence, intelligent systems, multi-agent systems
- ST1_15: Mathematical aspects of computer science
- ST1_14: Discrete mathematics and combinatorics
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Jagielloński, Wydział Matematyki i Informatyki
woj. małopolskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 5
Call: OPUS 2 - announced on 2011-09-15
Amount awarded: 585 000 PLN
Project start date (Y-m-d): 2012-08-28
Project end date (Y-m-d): 2015-05-27
Project duration:: 33 months (the same as in the proposal)
Project status: Project settled