Title of article :
A polynomial time solvable instance of the feasible minimum cover problem
Author/Authors :
Chor Ping Low، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Pages :
6
From page :
141
To page :
146
Keywords :
Vertex cover , maximum matching , Polynomial time algorithm , Algorithms , bipartite graph
Journal title :
Information Processing Letters
Serial Year :
1998
Journal title :
Information Processing Letters
Record number :
128978
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128978
