RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive
Diskretn. Anal. Issled. Oper., Ser. 1, 1997 Volume 4, Issue 3, Pages 3–8 (Mi da398)
Complexity of the determination of the maximum weighted joining in a graph

A. A. Ageev

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.17

Received: 23.04.1997



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026