 Отзывы покупателей. 
Добавить отзыв.  

Автор: Godsil Chris, Royle Gordon F. Название: Algebraic Graph Theory ISBN: 0387952411 ISBN13(EAN): 9780387952413 Издательство: Springer Цена: 6233 р. Наличие на складе: Есть у поставщика.Поставка под заказ.
 в Мои желания   

Автор: Gross Название: Handbook of Graph Theory, Second Edition ISBN: 1439880182 ISBN13(EAN): 9781439880180 Издательство: Taylor&Francis Цена: 8800 р. Наличие на складе: Есть у поставщика.Поставка под заказ.
 в Мои желания   

Название: Introduction to graph theory: h3 mathematics ISBN: 9812705252 ISBN13(EAN): 9789812705259 Издательство: World Scientific Publishing Цена: 11248 р. Наличие на складе: Поставка под заказ.
Описание: Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is
intended as a general introduction to graph theory and, in particular, as a resource book for junior college students and teachers reading and teaching the subject at H3 Level in the
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
 в Мои желания   

Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition) ISBN: 9812568859 ISBN13(EAN): 9789812568854 Издательство: World Scientific Publishing Цена: 5726 р. Наличие на складе: Поставка под заказ.
Описание: This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises
to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra
choices if they want to shift the emphasis of their course.
Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration
and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand,
showing that some questions at the forefront of research are comprehensible and accessible for the talented and hardworking undergraduate. The basic topics discussed are: the
twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity.
As the goal of the book is to encourage
students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
 в Мои желания   

Название: Graphtheoretic techniques for web content mining ISBN: 9812563393 ISBN13(EAN): 9789812563392 Издательство: World Scientific Publishing Цена: 14111 р. Наличие на складе: Поставка под заказ.
Описание: This book describes exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms. Graphs can model additional information which is often not present in commonly used data representations, such as vectors. Through the use of graph distance  a relatively new approach for determining graph similarity  the authors show how wellknown algorithms, such as kmeans clustering and knearest neighbors classification, can be easily extended to work with graphs instead of vectors. This allows for the utilization of additional information found in graph representations, while at the same time employing wellknown, proven algorithms.To demonstrate and investigate these novel techniques, the authors have selected the domain of web content mining, which involves the clustering and classification of web documents based on their textual substance. Several methods of representing web document content by graphs are introduced; an interesting feature of these representations is that they allow for a polynomial time distance computation, something which is typically an NPcomplete problem when using graphs. Experimental results are reported for both clustering and classification in three web document collections using a variety of graph representations, distance measures, and algorithm parameters.In addition, this book describes several other related topics, many of which provide excellent starting points for researchers and students interested in exploring this new area of machine learning further. These topics include creating graphbased multiple classifier ensembles through random node selection and visualization of graphbased data using multidimensional scaling.  в Мои желания   

Название: Introduction to graph theory: h3 mathematics ISBN: 9812703861 ISBN13(EAN): 9789812703866 Издательство: World Scientific Publishing Цена: 7056 р. Наличие на складе: Поставка под заказ.
Описание: Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is
intended as a general introduction to graph theory and, in particular, as a resource book for junior college students and teachers reading and teaching the subject at H3 Level in the
new Singapore mathematics curriculum for junior college. The book builds on the verity that graph theory at this level is a subject that lends itself well to the development of
mathematical reasoning and proof.
 в Мои желания   

Название: Walk through combinatorics, a: an introduction to enumeration and graph theory (2nd edition) ISBN: 9812568867 ISBN13(EAN): 9789812568861 Издательство: World Scientific Publishing Цена: 3272 р. Наличие на складе: Поставка под заказ.
Описание: This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises
to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra
choices if they want to shift the emphasis of their course.
Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration
and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand,
showing that some questions at the forefront of research are comprehensible and accessible for the talented and hardworking undergraduate.The basic topics discussed are: the
twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced
topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity. As the goal of the book is to encourage students to learn
more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.
 в Мои желания   

Название: Graph algorithms and applications 3 ISBN: 9812389393 ISBN13(EAN): 9789812389398 Издательство: World Scientific Publishing Цена: 8692 р. Наличие на складе: Поставка под заказ.
Описание: This book contains Volume 6 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peerreviewed scientific journal devoted to the publication of highquality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computeraided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.  в Мои желания   

Название: Graph algorithms and applications 5 ISBN: 981256845X ISBN13(EAN): 9789812568458 Издательство: World Scientific Publishing Цена: 11555 р. Наличие на складе: Поставка под заказ.
Описание: This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peerreviewed scientific journal devoted to the publication of highquality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computeraided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 22). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.  в Мои желания   

Название: Graph algorithms and applications 4 ISBN: 9812568441 ISBN13(EAN): 9789812568441 Издательство: World Scientific Publishing Цена: 11555 р. Наличие на складе: Поставка под заказ.
Описание: This book contains Volume 7 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peerreviewed scientific journal devoted to the publication of highquality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computeraided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 4 presents contributions from prominent authors and includes selected papers from (a) the Seventh International Workshop on Algorithms and Data Structures (WADS 21) and (b) the 21 Symposium on Graph Drawing (GD 21). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.  в Мои желания   

Автор: Martin Charles Golumbic Название: Algorithmic Graph Theory and Perfect Graphs,57 ISBN: 0444515305 ISBN13(EAN): 9780444515308 Издательство: Elsevier Science Цена: 5155 р. Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Conveys the message that intersection graph models are a necessary and important tool for solving realworld problems. This edition includes an Epilogue chapter, which covers topics such as the theory and applications of intersection graph models such as generalizations of permutation graphs and interval graphs.  в Мои желания   

Автор: Calude Cristian S. Название: Information and Randomness / An Algorithmic Perspective ISBN: 3540434666 ISBN13(EAN): 9783540434665 Издательство: Springer Цена: 5386 р. Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge. "Professor Calude has produced a firstrate exposition of uptodate work in information and randomness." D.S. Bridges, Canterbury University, coauthor, with Errett Bishop, of Constructive Analysis;"The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician; "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics  в Мои желания   
