What is Constrained Shortest Path First?

An Adventure Path is a series of interlinked adventures for tabletop role-playing games which can be played in succession and lead characters to advance from lower to higher levels, through...

In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called...

In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to...

A constrained conditional model is a machine learning and inference framework that augments the learning of conditional models with declarative constraints. The constraint can be used as a way to...

A path-vector routing protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates that have looped through the network and returned to the same...

Equal-cost multi-path routing is a routing strategy where packet forwarding to a single destination can occur over multiple best paths with equal routing priority. Multi-path routing can be used in...

In computer networks, a Path Computation Element is a system component, application, or network node that is capable of determining and finding a suitable route for conveying data between a...

Reverse-path forwarding is a technique used in modern routers for the purposes of ensuring loop-free forwarding of multicast packets in multicast routing and to help prevent IP address spoofing in...

In theoretical physics, path-ordering is the procedure that orders a product of operators according to the value of a chosen parameter: Here p is a permutation that orders the parameters...

Path-constrained rendezvous is the process of moving an orbiting object from its current position to a desired position and velocity, in such a way that no obstacles are contacted along...