Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...