Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Boyer, Kirk"'
Publikováno v:
In Discrete Applied Mathematics 15 June 2023 332:87-100
Autor:
Boyer, Kirk, Nelsen, Lauren M., Nelsen, Luke L., Pfender, Florian, Reiland, Elizabeth, Solava, Ryan
In 1935, Erd\H{o}s and Szekeres proved that $(m-1)(k-1)+1$ is the minimum number of points in the plane which definitely contain an increasing subset of $m$ points or a decreasing subset of $k$ points (as ordered by their $x$-coordinates). We conside
Externí odkaz:
http://arxiv.org/abs/1804.05952
Autor:
Boyer, Kirk, Brimkov, Boris, English, Sean, Ferrero, Daniela, Keller, Ariel, Kirsch, Rachel, Phillips, Michael, Reinhart, Carolyn
Publikováno v:
Discrete Applied Mathematics, Volume 258, 2019, Pages 35-48, ISSN 0166-218X
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices
Externí odkaz:
http://arxiv.org/abs/1801.08910
Autor:
Boyer, Kirk, Brimkov, Boris, English, Sean, Ferrero, Daniela, Keller, Ariel, Kirsch, Rachel, Phillips, Michael, Reinhart, Carolyn
Publikováno v:
In Discrete Applied Mathematics 15 April 2019 258:35-48
Publikováno v:
In Discrete Applied Mathematics 10 July 2017 225:11-21
Autor:
Yoo, S. J. Ben, Fei Xue, Bansal, Yash, Taylor, Julie, Zhong Pan, Jing Cao, Minyong Jeon, Nady, Tony, Goncher, Gary, Boyer, Kirk, Okamoto, Katsunari, Shin Kamei, Akella, Venkatesh
Publikováno v:
IEEE Journal on Selected Areas in Communications; Sep2003, Vol. 21 Issue 7, p1041, 11p, 12 Diagrams, 6 Graphs
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.