Please use this identifier to cite or link to this item: http://lib.hpu.edu.vn/handle/123456789/21145
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArumugam, S.en_US
dc.contributor.editorThulasiraman, Ken_US
dc.date.accessioned2016-06-10T08:30:18Z
dc.date.available2016-06-10T08:30:18Z
dc.date.issued2016en_US
dc.identifier.isbn978-1-4200-1107-4en_US
dc.identifier.isbn1420011073en_US
dc.identifier.otherHPU1160006en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/21145-
dc.description.abstractResearch in graph theory and combinatorial optimization has experienced explosive growth in the last three decades or so. Rapid technological advances such as those in telecommunication networks and large-scale integrated circuit design, emergence of new areas such as network science, which emphasizes applications in social networks and biological networks, and advances in theoretical computer science have all contributed to this explosion of interest and knowledge in graph theory and combinatorial optimization and related algorithmic issues. Therefore, it is no surprise that these disciplines have come to play a central role in engineering and computer science curricula. Several excellent textbooks dealing with graph theory or combinatorial optimization are now available.en_US
dc.format.extent1213 p.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.publisherCRC Pressen_US
dc.subjectGraph theoryen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectAlgorithmsen_US
dc.titleHandbook of graph theory, combinatorial optimization, and algorithmsen_US
dc.typeBooken_US
dc.size15,111KBen_US
dc.departmentEnglish resourcesen_US
Appears in Collections:Technology

Files in This Item:
File Description SizeFormat 
6_Handbook_ofgraphtheory.pdf
  Restricted Access
15.11 MBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.