Author
Hebert Perez-Roses
results may include different authors with the same name
2 papers
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 then we describe and implement a computer-based method to…
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\Delta$ and the diameter $D$, was introduced in \cite{maxddbs}, as a generalization of the Degree-Diameter…