|
|
|
|
| LEADER |
02618nam a22004575i 4500 |
| 001 |
978-81-322-0750-4 |
| 003 |
DE-He213 |
| 005 |
20151125192758.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121116s2013 ii | s |||| 0|eng d |
| 020 |
|
|
|a 9788132207504
|9 978-81-322-0750-4
|
| 024 |
7 |
|
|a 10.1007/978-81-322-0750-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a GPFC
|2 bicssc
|
| 072 |
|
7 |
|a TEC000000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 620
|2 23
|
| 100 |
1 |
|
|a Saha Ray, Santanu.
|e author.
|
| 245 |
1 |
0 |
|a Graph Theory with Algorithms and its Applications
|h [electronic resource] :
|b In Applied Science and Technology /
|c by Santanu Saha Ray.
|
| 264 |
|
1 |
|a India :
|b Springer India :
|b Imprint: Springer,
|c 2013.
|
| 300 |
|
|
|a XVI, 216 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 505 |
0 |
|
|a Dedication -- About the Author -- Preface -- Acknowledgement -- Table of Contents -- Introduction to Graphs -- Subgraphs, Paths and Connected Graphs -- Euler Graphs and Hamiltonian Graphs -- Trees and Fundamental Circuits -- Algorithms on Graphs -- Matrix Representation on Graphs -- Cut Sets and Cut Vertices -- Colouring -- Planar and Dual Graphs -- Network Flows -- Appendix -- References -- Index.
|
| 520 |
|
|
|a The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on constructions which consist of formal proofs, examples with applications. Uptill, there is scarcity of books in the open literature which cover all the things including most importantly various algorithms and applications with examples.
|
| 650 |
|
0 |
|a Engineering.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Graph theory.
|
| 650 |
|
0 |
|a Complexity, Computational.
|
| 650 |
1 |
4 |
|a Engineering.
|
| 650 |
2 |
4 |
|a Complexity.
|
| 650 |
2 |
4 |
|a Graph Theory.
|
| 650 |
2 |
4 |
|a Math Applications in Computer Science.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9788132207498
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-81-322-0750-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-ENG
|
| 950 |
|
|
|a Engineering (Springer-11647)
|
