Result 1 to 7 from 7 total
New algorithm for generation of spanning trees. (English)
Cybernetics 23, No.1, 107-113 (1987); translation from Kibernetika 1987, No.1, 85-89 (1987).
1
On realization of the algorithm for recognition of planarity and the packing of a graph on the plane for O(V) operations. (Russian)
Algorithms for the solution of network problems, Collect. Artic., Moskva 1984, 59-91 (1984).
2
An estimate of the effort in computing the gradient. (English)
Sov. Math., Dokl. 29, 384-387 (1984); translation from Dokl. Akad. Nauk SSSR 275, 1306-1309 (1984).
3
An effective algorithm for computing derivatives and extremal problems. (Russian)
Ehkon. Mat. Metody 20, 309-318 (1984).
4
A quick algorithm for the construction of the maximal flow in a network. (Russian)
Combinatorial methods in flow problems, Work Collect., 3, Moskva 1979, 90-96 (1979).
5
A fast algorithm for constructing a maximum flow through a network. (English)
Transl., Ser. 2, Am. Math. Soc. 158, 23-30 (1994); translation from Combinatorial methods in flow problems, Work Collect. 3, Moskva 1979, 90-96 (1979).
6
Lösung eines Problems der Multiproduktströme im Netz. (Russian)
Ehkon. Mat. Metody 13, 143-151 (1977).
7
Result 1 to 7 from 7 total
Start
Contact
Print
General Help
