dc.contributor.author | Arumugam, S. | en_US |
dc.contributor.editor | Thulasiraman, K | en_US |
dc.date.accessioned | 2016-06-10T08:30:18Z | |
dc.date.available | 2016-06-10T08:30:18Z | |
dc.date.issued | 2016 | en_US |
dc.identifier.isbn | 978-1-4200-1107-4 | en_US |
dc.identifier.isbn | 1420011073 | en_US |
dc.identifier.other | HPU1160006 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21145 | |
dc.description.abstract | Research 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.extent | 1213 p. | en_US |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.publisher | CRC Press | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Combinatorial optimization | en_US |
dc.subject | Algorithms | en_US |
dc.title | Handbook of graph theory, combinatorial optimization, and algorithms | en_US |
dc.type | Book | en_US |
dc.size | 15,111KB | en_US |
dc.department | English resources | en_US |