### Constructing Dominating Sets in Circulant Graphs

**2016-02-03**

1602.01286 | math.CO

We give an efficient construction of a reasonably small dominating set in a
circulant graph on $n$ notes and $k$ distinct chord lengths. This result is
based on bounds on some double exponential sums. .

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2018-05-07**

1805.02349 | cs.DS

We give a quasipolynomial time algorithm for the graph matching problem (also
known as noisy or robu… show more

**2018-11-16**

1811.06898 | cs.CG

We show how to construct $(1+\varepsilon)$-spanner over a set $P$ of $n$
points in $\mathbb{R}^d$ th… show more

**2019-03-18**

1903.07531 | cs.DS

We give a fully polynomial-time approximation scheme (FPTAS) to count the
number of independent sets… show more

**2019-03-12**

1903.05046 | math.ST

We study the problem of recovering a hidden binary $k$-sparse $p$-dimensional
vector $\beta$ from $n… show more

**2018-12-28**

1812.11152 | math.CO

Given $\varepsilon>0$, there exists $f_0$ such that, if $f_0 \le f \le
\Delta^2+1$, then for any gra… show more

**2019-02-11**

1902.03702 | cs.CC

Given an $n$-vertex bipartite graph $I=(S,U,E)$, the goal of set cover
problem is to find a minimum … show more

**2018-12-20**

1812.08480 | cs.DS

We study the query complexity of a permutation-based variant of the guessing
game Mastermind. In thi… show more

**2018-10-02**

1810.01161 | math.CO

Given positive integers $n\ge 2k$, a Kneser graph $KG_{n,k}$ is a graph whose
vertex set is the coll… show more

**2018-08-07**

1808.02512 | math.CO

Any triangle-free graph on $n$ vertices with minimum degree at least $d$
contains a bipartite induce… show more

**2018-09-06**

1809.02235 | stat.ML

We propose an adaptive sampling approach for multiple testing which aims to
maximize statistical pow… show more

**2018-10-05**

1810.02722 | math.PR

In the standard ball-in-bins experiment, a well-known scheme is to sample $d$
bins independently and… show more

**2015-02-10**

1502.02800 | cs.SC

For almost 35 years, Sch{\"o}nhage-Strassen's algorithm has been the fastest
algorithm known for mul… show more

**2012-09-10**

1209.2088 | math.CO

Order the vertices of a directed random graph \math{v_1,...,v_n}; edge
\math{(v_i,v_j)} for \math{i<… show more

**2018-02-07**

1802.02325 | cs.CC

In this paper we study the (Bichromatic) Maximum Inner Product Problem
(Max-IP), in which we are giv… show more

**2018-04-04**

1804.01308 | cs.DC

We present a deterministic distributed $2$-approximation algorithm for the
Minimum Weight Vertex Cov… show more

**2015-04-20**

1504.05240 | cs.CC

Many large arithmetic computations rely on tables of all primes less than
$n$. For example, the fast… show more