Title of article :
A polynomial algorithm for the extendability problem in bipartite graphs
Author/Authors :
J. Lakhal، نويسنده , , L. Litzler، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Pages :
6
From page :
11
To page :
16
Keywords :
graph theory , Perfect matching , Extendability , Algorithms , connectivity
Journal title :
Information Processing Letters
Serial Year :
1998
Journal title :
Information Processing Letters
Record number :
128809
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128809
بازگشت