Title of article :
Finding Minimum Generators of Path Systems
Author/Authors :
Frank ، نويسنده , , Andrلs، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
8
From page :
237
To page :
244
Abstract :
A simple algorithmic proof of a min–max theorem of E. Győri on generators of path systems is described. The algorithm relies on Dilworthʹs theorem.
Journal title :
Journal of Combinatorial Theory Series B
Serial Year :
1999
Journal title :
Journal of Combinatorial Theory Series B
Record number :
1526473
Link To Document :
بازگشت