- shortest time path
- путь с минимальным временем распространения (сейсмической волны)
Большой англо-русский и русско-английский словарь. 2001.
shortest time path
Смотреть что такое "shortest time path" в других словарях:
Time — This article is about the measurement. For the magazine, see Time (magazine). For other uses, see Time (disambiguation). The flow of sand in an hourglass can be used to keep track of elapsed time. It also concretely represents the present as… … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Critical path method — PERT chart for a project with five milestones (10 through 50) and six activities (A through F). The project has two critical paths: activities B and C, or A, D, and F – giving a minimum project time of 7 months with fast tracking. Activity E is… … Wikipedia
critical-path method — UK US noun [singular] business a method used in project management that shows which activities must be carried out so that the project can be completed in the shortest time and at the lowest cost Thesaurus: relating to management and running a… … Useful english dictionary
critical-path method — UK / US noun [singular] business a method used in project management that shows which activities must be carried out so that the project can be completed in the shortest time and at the lowest cost … English dictionary
critical-path method — /ˌkrɪtɪk(ə)l pɑ:θ ˌmeθəd/ noun a technique used in project management to identify the activities within a project that are critical to its success, usually by showing on a diagram or flow chart the order in which activities must be carried out so … Marketing dictionary in english
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… … Wikipedia
Longest path problem — In graph theory, the longest path problem is a problem of finding the longest path in a graph. Unlike the shortest path problem, this problem is NP complete which means that the optimal solution cannot be found in polynomial time unless P=NP.The… … Wikipedia
minimum flight path — The path that must be flown between two points to arrive at the destination in the shortest possible time. A great circle is the shortest distance between two points, but a minimal flight path may be followed to take advantage of favorable winds… … Aviation dictionary
путь с минимальным временем распространения — (сейсмической волны) [http://slovarionline.ru/anglo russkiy slovar neftegazovoy promyishlennosti/] Тематики нефтегазовая промышленность EN shortest time path … Справочник технического переводчика
