Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Graeme Kemkes"'
Publikováno v:
Informatics in Education, Vol 5, Iss 1, Pp 15-36 (2006)
We identify aspects of computing competition formats as they relate to the purpose of these competitions, both stated and tacit. We consider the major international competitions - the International Olympiad for Informatics, the ACM International Coll
Externí odkaz:
https://doaj.org/article/1b61d8b7922f40119b4babd608aa183d
Publikováno v:
Combinatorics, Probability and Computing. 22:346-350
For a positive integer r ≥ 2, a Kr-factor of a graph is a collection vertex-disjoint copies of Kr which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemerédi asserts that every graph on n vertices with minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec35fecdc2d854bc71d1b03995f9f968
https://doi.org/10.1017/s0963548313000059
https://doi.org/10.1017/s0963548313000059
Autor:
Nicholas C. Wormald, Graeme Kemkes
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:342-362
We improve Luczak's upper bounds on the length of the longest cycle in the random graph G(n,M) in the "supercritical phase" where M=n/2+s and s=o(n) but n^{2/3}=o(s). The new upper bound is (6.958+o(1))s^2/n with probability 1-o(1) as n approaches in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212d5a0facd0f722f0475cc1a4f6f5df
https://doi.org/10.1137/090766279
https://doi.org/10.1137/090766279
We derive asymptotic expansions for the Stirling numbers of real arguments as defined by Flajolet and Prodinger. We also generalize certain classical identities for Stirling numbers with integral arguments to real or complex arguments.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a4d3b3752e332fff1de0361b1ecae3c
https://doi.org/10.1137/s0895480102401119
https://doi.org/10.1137/s0895480102401119
Publikováno v:
Random Structures & Algorithms. 43:354-376
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on n vertices and m edges, provided that m - n →∞ and m = O(nlog n) as n →∞. This is the entire range of m not covered by previous results. The proof in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d328af4c6a45e5bcffd7d3b3e6219dec
https://doi.org/10.1002/rsa.20415
https://doi.org/10.1002/rsa.20415
Publikováno v:
Journal of Combinatorics. 2:397-411
We consider graph densities in countably inflnite graphs. The independence density of a flnite graph G of order n is its proportion of independent sets to all subsets of vertices, while the chromatic density is its proportion of proper n-colourings t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4198cccb6877f923c8f2a5b160a79d6c
https://doi.org/10.4310/joc.2011.v2.n3.a3
https://doi.org/10.4310/joc.2011.v2.n3.a3
Publikováno v:
European Journal of Operational Research. 207:318-329
The graph model for conflict resolution provides a convenient and effective means to model and analyze a strategic conflict. Standard practice is to carry out a stability analysis of a graph model, and then to follow up with a post-stability analysis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c50c9208e372313d9a59091985868dd3
https://doi.org/10.1016/j.ejor.2010.03.025
https://doi.org/10.1016/j.ejor.2010.03.025
Publikováno v:
Advances in Mathematics. 223(1):300-328
In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d(2k−3)log(k−1), then the value k−1 is discarded and thus the chromatic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38e64420fa68a877792557588499863f
Publikováno v:
Informatics Education – The Bridge between Using and Understanding Computers ISBN: 9783540482185
ISSEP
ISSEP
Computing competitions like the International Olympiad in Informatics (IOI) typically pose several problems that contestants are required to solve by writing a program. The program is tested automatically on several sets of input data to determine wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::065f2f8f15490f7a20477698344515d1
https://doi.org/10.1007/11915355_22
https://doi.org/10.1007/11915355_22
Publikováno v:
Discrete Mathematics. (10):1652-1657
We consider cop-win graphs in the binomial random graph G(n,1/2). We prove that almost all cop-win graphs contain a universal vertex. From this result, we derive that the asymptotic number of labelled cop-win graphs of order n is equal to (1+o(1))n2^
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26a4746a1046c26130aeb64c024166d6