Created: —
Viewed: 179

## Dominating set of given size $k$ in $O(2^k |V| |E|)$

Recently I’ve encountered an interesting case of dominating set problem: given an unweighted and undirected graph $$G(V, E)$$ and knowing that it contains a dominating set of size $$k$$, find any such dominating set in time $$O(2^k\ \vert V \vert\ \vert E \vert)$$.

During my research, I found only some algorithms to find fixed-size dominating set in a $$d$$-degenerated graphs, but no such restriction is applied in this problem.

Is there any way to solve that problem in such time?

## Does there always exist a dominating measure?

Let $$\{\mu_i\}$$ be a family of probability borel measures on $$\mathbb{R}^n$$.

Then, does there always exist a Borel measure $$\mu$$ on $$\mathbb{R}^n$$ such that $$\mu_i \ll \mu$$ for all $$i$$?

## Blog-posts pages are dominating in search console “Internal Links”.

Hi all,

Ours is WordPress website and we have a blog…website.com/blog/. All the important pages in the website are well linked from top and footer menu. But in our webmasters…internal links section, only homepage is at the top. Blog-posts are others followed by homepage. I wonder why blog pages are dominating our website pages. Please give your suggestions on this. Do you think Google will give more priority for the blog-posts than website pages as they are more linked technically?

Thanks