Sciweavers

2796 search results - page 9 / 560
» The coolest path problem
Sort
View
BIRTHDAY
2009
Springer
15 years 4 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
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...
Gregory Gutin, Eun Jung Kim
76
Voted
IEEEPACT
2006
IEEE
15 years 3 months ago
Program generation for the all-pairs shortest path problem
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...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
TEC
2002
117views more  TEC 2002»
14 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
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 ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
ICN
2005
Springer
15 years 3 months ago
Primary/Secondary Path Generation Problem: Reformulation, Solutions and Comparisons
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...
Quanshi Xia, Helmut Simonis
NETWORKS
2002
14 years 9 months ago
Node-disjoint paths and related problems on hierarchical cubic networks
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...
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh