3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DS2018
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…
math.CO2015★ 3 cited
Searching for Large Circulant Graphs
Ramiro Feria-Puron, Hebert Perez-Roses, Joe Ryan
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and…