The expressibility of fragments of Hybrid Graph Logic on finite digraphs
(2013)
Journal Article
Gate, J., & Stewart, I. (2013). The expressibility of fragments of Hybrid Graph Logic on finite digraphs. Journal of applied logic, 11(3), 272-288. https://doi.org/10.1016/j.jal.2013.05.002
Outputs (6)
Candidate set parallelization strategies for Ant Colony Optimization on the GPU (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013, December). Candidate set parallelization strategies for Ant Colony Optimization on the GPU. Presented at 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP'13, Vietri sul MareFor solving large instances of the Travelling Salesman Problem (TSP), the use of a candidate set (or candidate list) is essential to limit the search space and reduce the overall execution time when using heuristic search methods such as Ant Colony O... Read More about Candidate set parallelization strategies for Ant Colony Optimization on the GPU.
Multiswapped networks and their topological and algorithmic properties (2013)
Journal Article
Stewart, I. (2013). Multiswapped networks and their topological and algorithmic properties. Journal of Computer and System Sciences, 79(8), 1269-1286. https://doi.org/10.1016/j.jcss.2013.06.002We generalise the biswapped network Bsw(G)Bsw(G) to obtain a multiswapped network Msw(H;G)Msw(H;G), built around two graphs G and H. We show that the network Msw(H;G)Msw(H;G) lends itself to optoelectronic implementation and examine its topological a... Read More about Multiswapped networks and their topological and algorithmic properties.
Improving Ant Colony Optimization performance on the GPU using CUDA. (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013, December). Improving Ant Colony Optimization performance on the GPU using CUDA. Presented at 2013 IEEE Congress on Evolutionary Computation, Cancun, MexicoWe solve the Travelling Salesman Problem (TSP) using a parallel implementation of the Ant System (AS) algorithm for execution on the Graphics Processing Unit (GPU) using NVIDIA CUDA. Extending some recent research, we implement both the tour construc... Read More about Improving Ant Colony Optimization performance on the GPU using CUDA..
Interconnection networks of degree three obtained by pruning two-dimensional tori (2013)
Journal Article
Stewart, I. (2014). Interconnection networks of degree three obtained by pruning two-dimensional tori. IEEE Transactions on Computers, 63(10), 2473-9340. https://doi.org/10.1109/tc.2013.139We study an interconnection network that we call 3Torus(m,n) obtained by pruning the 4m x 4n torus (of links) so that the resulting network is regular of degree 3. We show that 3Torus(m,n) retains many of the useful properties of tori (although, of c... Read More about Interconnection networks of degree three obtained by pruning two-dimensional tori.
Graph editing to a fixed target (2013)
Presentation / Conference Contribution
Golovach, P., Paulusma, D., & Stewart, I. A. (2013, December). Graph editing to a fixed target. Presented at International Workshop on Combinatorial Algorithms, Rouen, FranceFor a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex di... Read More about Graph editing to a fixed target.