Classes of Directed Graphs: Springer Monographs in Mathematics
Editat de Jørgen Bang-Jensen, Gregory Gutinen Limba Engleză Hardback – 3 iul 2018
Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field.
Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 617.11 lei 38-44 zile | |
Springer International Publishing – 25 ian 2019 | 617.11 lei 38-44 zile | |
Hardback (1) | 969.93 lei 3-5 săpt. | |
Springer International Publishing – 3 iul 2018 | 969.93 lei 3-5 săpt. |
Din seria Springer Monographs in Mathematics
- 18% Preț: 1234.77 lei
- 18% Preț: 753.23 lei
- 20% Preț: 574.70 lei
- 24% Preț: 740.03 lei
- 24% Preț: 777.43 lei
- 20% Preț: 818.29 lei
- 20% Preț: 758.03 lei
- 9% Preț: 904.20 lei
- 15% Preț: 607.33 lei
- 8% Preț: 529.41 lei
- 24% Preț: 1598.61 lei
- Preț: 396.40 lei
- 18% Preț: 793.14 lei
- 15% Preț: 650.86 lei
- 18% Preț: 1236.19 lei
- 15% Preț: 499.77 lei
- Preț: 391.61 lei
- 18% Preț: 1404.30 lei
- 18% Preț: 797.24 lei
- 18% Preț: 916.25 lei
- Preț: 397.01 lei
- 15% Preț: 657.25 lei
- 15% Preț: 467.79 lei
- 15% Preț: 648.05 lei
- Preț: 406.25 lei
- Preț: 389.88 lei
- 15% Preț: 649.54 lei
- 15% Preț: 581.14 lei
- 15% Preț: 643.48 lei
- 15% Preț: 647.73 lei
- 18% Preț: 902.55 lei
- 15% Preț: 653.33 lei
- 18% Preț: 901.88 lei
- 18% Preț: 907.27 lei
- 18% Preț: 893.53 lei
- 15% Preț: 659.53 lei
- 18% Preț: 802.28 lei
- 15% Preț: 661.32 lei
- 15% Preț: 646.62 lei
- Preț: 384.48 lei
- 15% Preț: 704.36 lei
- 18% Preț: 1248.20 lei
- 18% Preț: 1031.17 lei
- Preț: 409.13 lei
- 18% Preț: 986.01 lei
- 15% Preț: 640.37 lei
- 15% Preț: 643.34 lei
- Preț: 388.72 lei
- 18% Preț: 965.34 lei
Preț: 969.93 lei
Preț vechi: 1182.84 lei
-18% Nou
Puncte Express: 1455
Preț estimativ în valută:
185.62€ • 193.07$ • 153.24£
185.62€ • 193.07$ • 153.24£
Carte disponibilă
Livrare economică 24 martie-07 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319718392
ISBN-10: 3319718398
Pagini: 638
Ilustrații: XXII, 636 p. 109 illus., 4 illus. in color.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.15 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Monographs in Mathematics
Locul publicării:Cham, Switzerland
ISBN-10: 3319718398
Pagini: 638
Ilustrații: XXII, 636 p. 109 illus., 4 illus. in color.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.15 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Monographs in Mathematics
Locul publicării:Cham, Switzerland
Cuprins
1. Basic Terminology, Notation and Results (J. Bang-Jensen, G. Gutin).- 2. Tournaments and Semicomplete Digraphs (J. Bang-Jensen, F. Havet).- 3. Acyclic Digraphs (G. Gutin).- 4. Euler Digraphs (M. Wahlström).- 5. Planar digraphs (M. Pilipczuk, M. Pilipczuk).- 6. Locally Semicomplete Digraphs and Generalizations (J. Bang-Jensen).- 7. Semicomplete Multipartite Digraphs (A. Yeo).- 8. Quasi-Transitive Digraphs and Their Extensions (H. Galeana-Sánchez, C. Hernández-Cruz).- 9. Digraphs of Bounded Width (S. Kreutzer, O. Kwon).- 10. Digraphs Products (R. Hammack).- 11. Miscellaneous Digraph Classes (Y. Guo, M. Surmacs).- 12. Lexicographic Orientation Algorithms (J. Huang).- Indices.
Notă biografică
Jørgen Bang-Jensen is a professor in the Department of Mathematics and Computer science at the University of Southern Denmark, Odense, Denmark.
Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.
Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.
Textul de pe ultima copertă
This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic.
Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field.
Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
Caracteristici
Presents the latest research in the subject area, including significant new results obtained over recent years Illustrates various approaches, techniques and algorithms used in digraph theory Explores structural results as well as algorithms and complexity, including results on fixed parameter tractability Collects over 120 open problems and conjectures