The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with bounded expansion, which include e.g. proper minor-closed graph classes, classes closed on topological minors or classes of graphs that can be drawn on a fixe...

We consider exact system identification in the behavioral setting: Given an (noise-free) finite time series, find set of bounded complexity linear time-invariant systems that fit data exactly. First, we modify notion most powerful unfalsified model for case by fixing number inputs and minimizing order. Then, give necessary sufficient identifiability conditions, i.e., conditions under which true...

In this paper, we introduce and study the stable topology on the set of prime filters of a bounded 0-distributive lattice. The stable topology is a subtopology of the hull kernel topology on the set of prime filters of a bounded 0-distributive lattice. Sufficient condition is given under which the hull kernel topology and stable topology coincide on the set of prime filters (the set of maximal ...