In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...