Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Algorithmic aspects of random graphs.

2014/13/D/ST1/01175

Keywords:

algorithm distributed algorithms random graphs networks

Descriptors:

  • ST1_15: Mathematical aspects of computer science
  • ST1_14: Discrete mathematics and combinatorics
  • ST1_13: Probability and statistics

Panel:

ST1 - Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics

Host institution :

Uniwersytet im. Adama Mickiewicza w Poznaniu, Wydział Matematyki i Informatyki

woj. wielkopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Katarzyna Rybarczyk-Krzywdzińska 

Number of co-investigators in the project: 1

Call: SONATA 7 - announced on 2014-03-17

Amount awarded: 153 680 PLN

Project start date (Y-m-d): 2015-01-27

Project end date (Y-m-d): 2018-07-26

Project duration:: 42 months (the same as in the proposal)

Project status: Project settled

Equipment purchased [PL]

  1. skaner (228 PLN)
  2. monitor (665 PLN)
  3. laptop (6 000 PLN)

Information in the final report

  • Publication in academic press/journals (6)
  1. Finding Hamilton cycles in random intersection graphs.
    Authors:
    Katarzyna Rybarczyk
    Academic press:
    Discrete Mathematics and Thoretical Computer Science (rok: 2018, tom: 20, strony: #8), Wydawca: DMTCS French association in cooperation with the Episciences Iniative
    Status:
    Published
    DOI:
    brak - link to the publication
  2. GHS algorithm on a graph with random weights
    Authors:
    Katarzyna Rybarczyk
    Academic press:
    Theoretical Computer Science , Wydawca: Elsevier
    Status:
    Submitted
    DOI:
    brak - link to the publication
  3. Hamilton cycles in the line graph of a random graph
    Authors:
    Katarzyna Rybarczyk
    Academic press:
    Electronic Notes in Discrete Mathematics (rok: 2017, tom: 61, strony: 1027-131), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.endm.2017.07.068 - link to the publication
  4. The cover time of a sparse random intersection graph
    Authors:
    M. Bloznelis, J. Jaworski i K. Rybarczyk
    Academic press:
    Annals of Applied Probability , Wydawca: Institute of Mathematics and Statistics
    Status:
    Submitted
    DOI:
    brak - link to the publication
  5. Distributed algorithms for random graphs
    Authors:
    Krzysztof Krzywdziński i Katarzyna Rybarczyk
    Academic press:
    Theoretical Computer Science (rok: 2015, tom: 605, strony: 95-105), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2015.08.037 - link to the publication
  6. The chromatic number of random intersection graphs
    Authors:
    Katarzyna Rybarczyk
    Academic press:
    Discussiones Mathematicae Graph Theory (rok: 2017, tom: 37(2), strony: 465-476), Wydawca: FACULTY OF MATHEMATICS, COMPUTER SCIENCE AND ECONOMETRICS , UNIVERSITY OF ZIELONA GORA
    Status:
    Published
    DOI:
    10.7151/dmgt.1955 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy