Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Jason Grout"'
Publikováno v:
Journal of Sports Analytics. 1:33-42
In 2011, the Boston Athletic Association tightened the standards to qualify for the Boston Marathon from 2013 onwards. By simply deducting five minutes and eliminating grace periods, the BAA failed to address differences between female and male quali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e960960a1d7a8ad98741c1ee2a37a85
https://doi.org/10.3233/jsa-150003
https://doi.org/10.3233/jsa-150003
Publikováno v:
Linear Algebra and its Applications. 432:2995-3001
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ij th entry (for i ≠ j ) is nonzero whenever { i , j } is an edge in G and is zero otherwise. Minimum rank is a difficult parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcdda38637f09f77a873de99d16df9b7
https://doi.org/10.1016/j.laa.2010.01.008
https://doi.org/10.1016/j.laa.2010.01.008
Publikováno v:
Linear Algebra and its Applications. 430:890-923
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f75159386f65a5b0596adf638867877
https://doi.org/10.1016/j.laa.2008.08.025
https://doi.org/10.1016/j.laa.2008.08.025
Publikováno v:
Discrete Mathematics and Its Applications ISBN: 9781466507289
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd08c4d0025bc7197af44e8f8c482cb1
https://doi.org/10.1201/b16113-112
https://doi.org/10.1201/b16113-112
Publikováno v:
The Electronic Journal of Linear Algebra. 23
The minimum rank of a simple graph G over a field F is the smallest possible rank among all real symmetric matrices, over F, whose (i, j)-entry (for i 6= j) is nonzero whenever ij is an edge in G and is zero otherwise. In this paper, the problem of m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::308a3c3f4494373aaf739991ea6a1989
https://doi.org/10.13001/1081-3810.1511
https://doi.org/10.13001/1081-3810.1511
Publikováno v:
The Electronic Journal of Linear Algebra. 18
The minimum rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose (i, j)th entry (for ij) isnonzero whenever {i, j} isan edge in G and is zero otherwise. A universally optimal matrix is define
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d19adc8afd9165dc1e12aff308ee12a
https://doi.org/10.13001/1081-3810.1321
https://doi.org/10.13001/1081-3810.1321
Autor:
Hana Kim, Bokhee Im, Olga Pryporova, Jason Grout, Mary Allison, Kendrick Savage, Elizabeth Bodine, Joyati Debnath, Colin Garnett, Reshmi Nair, Bryan L. Shader, Leslie Hogben, Luz Maria DeAlba, Laura DeLoss, Amy Wangsness Wehe
Publikováno v:
Linear Algebra and its Applications. (10):2457-2472
The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. The problem of determining
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b6fc3278c698559009f6742f4dc9026
Autor:
IDOWU, SAMUEL1 samuelid@chalmers.se, STRÜBER, DANIEL2 danstru@chalmers.se, BERGER, THORSTEN3 thorsten.berger@rub.de
Publikováno v:
ACM Computing Surveys. Jul2023, Vol. 55 Issue 7, p1-35. 35p.
Autor:
Héder, Mihály1, Rigó, Ernő1, Medgyesi, Dorottya1, Lovas, Róbert2, Tenczer, Szabolcs1, Török, Ferenc3, Farkas, Attila2, Emődi, Márk2, Kadlecsik, József4, Mező, György5, Pintér, Ádám3, Kacsuk, Péter2
Publikováno v:
Information Society / Információs Társadalom (InfTars). 2022, Vol. 22 Issue 2, p128-137. 10p.
Publikováno v:
ACM Transactions on Computer-Human Interaction (TOCHI); Aug2023, Vol. 30 Issue 4, p1-53, 53p