A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
The use of rules in a distributed environment creates new challenges for the development of active rule execution models. In particular, since a single event can trigger multiple ...
Ying Jin, Susan Darling Urban, Suzanne W. Dietrich
: The increasing ability for the sciences to sense the world around us is resulting in a growing need for data driven applications that are under the control of workflows composed ...