A SIMPLE ALGORITHM TO FIND MAXIMUM MATCHING FOR COMPLETE GRAPH AND COMPLETE BIPARTITE GRAPH: USING INCIDENCE MATRIX APPROACH. (2016)

Record Type:: Journal Article
Title:: A SIMPLE ALGORITHM TO FIND MAXIMUM MATCHING FOR COMPLETE GRAPH AND COMPLETE BIPARTITE GRAPH: USING INCIDENCE MATRIX APPROACH. (2016)
Main Title:: A SIMPLE ALGORITHM TO FIND MAXIMUM MATCHING FOR COMPLETE GRAPH AND COMPLETE BIPARTITE GRAPH: USING INCIDENCE MATRIX APPROACH
Authors:: BAIDARI, ISHWAR
GURANI, VIJAYKUMAR
Is Part Of:: Journal of mathematical and computational science. Volume 6:Number 2(2016)
Journal:: Journal of mathematical and computational science
Issue:: Volume 6:Number 2(2016)
Issue Display:: Volume 6, Issue 2 (2016)
Year:: 2016
Volume:: 6
Issue:: 2
Issue Sort Value:: 2016-0006-0002-0000
Page Start:
Page End:
Publication Date:: 2016
Subjects:: Mathematics -- Periodicals
510.5
Journal URLs:: http://www.scik.org/index.php/jmcs ↗
Languages:: English
ISSNs:: 1927-5307
Deposit Type:: Legaldeposit
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗
Physical Locations:: British Library HMNTS - ELD Digital store
Ingest File:: 15633.xml