44 citations · 50 across the 5 of their papers we have counts for
4 papers · 1 filter
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar +2
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is…
Hamiltonian cycles and subsets of discounted occupational measures
Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski +1
We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding pa…
Zero forcing number of graphs
Thomas Kalinowski, Nina Kamčev, Benny Sudakov
A subset of initially infected vertices of a graph is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infe…
Cube-magic labelings of grids
Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski
We show that the vertices and edges of a -dimensional grid graph () can be labeled with the integers from and $\{1,\ldots,\…