Zobrazeno 1 - 10
of 446
pro vyhledávání: '"Koko K"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 3, Pp 298-306 (2018)
Let be the set of all matrices, where and are the sums of entries in row and column , respectively. Sampling efficiently uniformly at random elements of is a problem with interesting applications in Combinatorics and Statistics. To calibrate the stat
Externí odkaz:
https://doaj.org/article/d4f7d00ff49b44748f4c45a1a6b1b1d8
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 8-21 (2015)
A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a $k$-hypertournament, the score $s_{i}$ (losing score $r_{i}$) of a vertex $v_
Externí odkaz:
https://doaj.org/article/d0e82920cff74fe5803c328c7884adb5
To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is $\#P$ hard, so only approximations are envisageable. A Markov chain allowing uniform sampling of all possible solutions is given by Luby, Randall and Sincla
Externí odkaz:
http://arxiv.org/abs/1803.06914
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics December 2018 15(3):298-306
Autor:
Kayibi, Koko K., Pirzada, S.
Publikováno v:
In Discrete Mathematics 6 June 2016 339(6):1629-1639
Publikováno v:
Agronomie Africaine; Vol. 34 No. 3 (2022); 429-440
écosystémiques fournis par deux espèces du genre Cochlospermum fortement exploitées au Bénin. Cent quatre femmes commerçantes de Cochlospermum ont été interviewées dans trois marches principaux. Les savoirs des femmes de différents groupes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=78975075580c::78b123127a6e0ca6f803ed6f4eba9bbe
https://www.ajol.info/index.php/aga/article/view/239987
https://www.ajol.info/index.php/aga/article/view/239987
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 2, Pp 183-217 (2018)
The authors in the paper [15] presented an algorithm that generates uniformly all the bipartite realizations and the other algorithm that generates uniformly all the simple bipartite realizations whenever A is a bipartite degree sequence of a simple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50a5a5f24d20ba5d3dc52615c7a8e35a
https://doi.org/10.2478/ausi-2018-0010
https://doi.org/10.2478/ausi-2018-0010
Publikováno v:
Acta Universitatis Sapientiae: Mathematica, Vol 10, Iss 1, Pp 189-197 (2018)
Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M; x, y), then Tij counts the sets of corank i and nullity j and each such set is a cyclic flat of M. The main result of this article consists of ext
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02298dc4060096662de575618a354a5e
https://doaj.org/article/0a5a6042863741d883a3c4c0f4d107e5
https://doaj.org/article/0a5a6042863741d883a3c4c0f4d107e5
Publikováno v:
Creative Mathematics and Informatics. 25:177-182
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bd9c1b0ba47de472c118cd358477fc2
https://doi.org/10.37193/cmi.2016.02.09
https://doi.org/10.37193/cmi.2016.02.09