Title of article :
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Author/Authors :
Y. Daniel Liang، نويسنده , , Norbert Blum، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1995
Pages :
5
From page :
215
To page :
219
Keywords :
Algorithms , Circular convex bipartite graph , Hamiltonian circuit , Maximummatching , Convex bipartite graph
Journal title :
Information Processing Letters
Serial Year :
1995
Journal title :
Information Processing Letters
Record number :
128382
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128382
بازگشت