Results 231 to 240 of about 8,828 (263)

Constructing an edge-route guaranteed optimal fault-tolerant routing for biconnected graphs

Proceedings of the Fifth Asian Test Symposium (ATS'96), 2002
Consider a graph that corresponds to a communication network in which a limited number of edge and/or node faults might occur. A routing for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty.
Yupin Luo, Shiyuan Yang, Dongcheng Hu
openaire   +1 more source

CannySR: Using smart routing of edge drawing to convert Canny binary edge maps to edge segments

2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA), 2015
Canny Edge Detector is the most widely used operator for edge detection. The problem with Canny is that it outputs a binary edge map, where an edge pixel (edgel) is marked (e.g., its value in the edge map is 255) and a non-edge pixel is unmarked (e.g., its value in the edge map is 0).
Cuneyt Akinlar, Edward Chome
openaire   +1 more source

Minimal functional routes in directed graphs with dependent edges

International Transactions in Operational Research, 2013
AbstractGraphs are mathematical structures used to model a set of objects and the relations between them. One of the basic concepts of graph theory, the path, has wide real‐world applications. In classic graph models, edges ending at a node are assumed to be independent.
Rui-Sheng Wang, Zhongyao Sun, Réka Albert   +2 more
openaire   +2 more sources

Routing Permutations on a 2D Grid with One-Way Edges

Parallel Processing Letters, 1997
We deal with the permutation routing problem on the m × n grid with one-register vertices and one-way edges. We give a routing algrithm of O(m + n) steps which is local, that is, the routing decision of every vertex depends on the states of vertices O(1) apart.
openaire   +1 more source

Probabilistic Edge Multicast Routing for the XRP Network

GLOBECOM 2022 - 2022 IEEE Global Communications Conference, 2022
Vytautas Tumas, Sean Rivera, Damien Magoni, Radu State   +3 more
openaire   +1 more source

Constrained bipartite edge coloring with applications to wavelength routing

1997
Motivated by the problem of efficient routing in all-optical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an L-regular bipartite graph are already colored with αL different colors, then the rest of the edges can be colored using at most (1+α/2)L ...
PERSIANO, Giuseppe, ERLEBACH T, JANSEN K, KAKLAMANIS C.   +3 more
openaire   +2 more sources

General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing

Transportation Science, 2023
Jin-Kao Hao
exaly  

Edge Assembly Crossover for the Capacitated Vehicle Routing Problem

2007
We propose an evolutionary algorithm (EA) that applies to the capacitated vehicle routing problem (CVRP). The EA uses edge assembly crossover (EAX) which was originally designed for the traveling salesman problem (TSP). EAX can be straightforwardly extended to the CVRP if the constraint of the vehicle capacity is not considered.
openaire   +1 more source

Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks

IEEE Transactions on Wireless Communications, 2021
Weiliang Zhao, Ammar Hawbani, Ahmed Al-Dubai   +2 more
exaly  

Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers

IEEE/ACM Transactions on Networking, 2022
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang   +2 more
exaly