Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Vertex cover: further observations and further improvements
Journal of Algorithms
Scalable Parallel Algorithms for FPT Problems
Algorithmica
On improving fpt k-vertex cover, with applications to some combinatorial problems
On improving fpt k-vertex cover, with applications to some combinatorial problems
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parameterized Complexity
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
The use of fast approximate graph coloring to enhance exact parallel algorithm performance
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
| Hi-index | 0.00 |
The significance of dynamic parallel load balancing is considered in the context of fixed parameter tractability. The well known vertex cover problem is used as a case study. Several algorithms are developed and tested on graphs derived from real biological data. Implementations are carried out on the Kraken supercomputer, currently the world's fastest computational platform for open science. We show that for certain difficult instances of biological data graphs our approach scales well up to 2400 processors.