This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...