Search Results for ""
41 - 50 of 1848 for Shortest path problemSearch Results
View search results from all Wolfram sites (161941 matches)The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...
Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
The question of whether a solution to a given problem exists. The existence problem can be solved in the affirmative without actually finding a solution to the original ...
A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...
A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...
A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.
The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.
Hansen's problem is a problem in surveying described as follows. From the position of two known but inaccessible points A and B, determine the position of two unknown ...
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
...