NEW ALGORITHM FOR SEARCHING CRITICAL PATHS IN GRAPH AND ITS APPLICATION
The paper proposes a new algorithm for searching critical paths in a graph which is based on the idea of execution of ternary operations over a matrix of arch balance of the graph. Application of the algorithm for solving ordered and network planning problems is considered in the paper
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Belarusian National Technical University
2008-08-01
|
| Series: | Nauka i Tehnika |
| Online Access: | https://sat.bntu.by/jour/article/view/785 |