» książki » Mathematics - Graphic Methods
topmenu
 |
Graph Symmetry: Algebraic Methods and Applications
ISBN: 9780792346685 / Angielski / Twarda / 418 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of...
The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatoria...
|
cena:
783,57 zł |
 |
Exercises in Graph Theory
ISBN: 9780792349068 / Angielski / Twarda / 356 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book supplements the textbook of the authors" Lectures on Graph The ory" 6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees,...
This book supplements the textbook of the authors" Lectures on Graph The ory" 6] by more than thousand exercises of varying complexity. The books mat...
|
cena:
901,12 zł |
 |
Graph Theory for Programmers: Algorithms for Processing Trees
ISBN: 9780792364283 / Angielski / Twarda / 432 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful algorithms appearing in numerous sources and occasionally encountered. It was absolutely that most of these re sults would finally be forgotten because it is impossible to run through the entire variety of sources where these materials could be published. Therefore, we decided to do what we can to correct this situation. We discussed this problem with Ershov and came to an idea to write an encyclopedia of algorithms on graphs focusing our main...
In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful a...
|
cena:
391,77 zł |
 |
The Steiner Ratio
ISBN: 9780792370154 / Angielski / Twarda / 244 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the most famous combinatorial-geometrical problems, but unfortunately it is very difficult in terms of combinatorial structure as well as computational complexity. However, if only a Minimum Spanning Tree (MST) without additional vertices in the interconnecting network is sought, then it is simple to...
Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which i...
|
cena:
391,77 zł |
 |
ARC Routing: Theory, Solutions and Applications
ISBN: 9780792378983 / Angielski / Twarda / 483 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Arc Routing: Theory, Solutions and Applications is about arc traversal and the wide variety of arc routing problems, which has had its foundations in the modern graph theory work of Leonhard Euler. Arc routing methods and computation has become a fundamental optimization concept in operations research and has numerous applications in transportation, telecommunications, manufacturing, the Internet, and many other areas of modern life. The book draws from a variety of sources including the traveling salesman problem (TSP) and graph theory, which are used and studied by operations...
Arc Routing: Theory, Solutions and Applications is about arc traversal and the wide variety of arc routing problems, which has had its founda...
|
cena:
1763,10 zł |
 |
Adaptive Filtering: Algorithms and Practical Implementation
ISBN: 9780792399124 / Angielski / Twarda / 443 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The field of Digital Signal Processing has developed so fast in the last two decades that it can be found in the graduate and undergraduate programs of most universities. This development is related to the growing available techno logies for implementing digital signal processing algorithms. The tremendous growth of development in the digital signal processing area has turned some of its specialized areas into fields themselves. If accurate information of the signals to be processed is available, the designer can easily choose the most appropriate algorithm to process the signal. When dealing...
The field of Digital Signal Processing has developed so fast in the last two decades that it can be found in the graduate and undergraduate programs o...
|
cena:
391,77 zł |
 |
Graphs on Surfaces
ISBN: 9780801866890 / Angielski / Twarda / 304 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous four-color theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of... Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known... |
cena:
445,45 zł |
 |
Transfiniteness: For Graphs, Electrical Networks, and Random Walks
ISBN: 9780817638184 / Angielski / Twarda / 246 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. "What good is a newborn baby?" Michael Faraday's reputed response when asked, "What good is magnetic induction?" But, it must be admitted that a newborn baby may die in infancy. What about this one- the idea of transfiniteness for graphs, electrical networks, and random walks? At least its bloodline is robust. Those subjects, along with Cantor's transfinite numbers, comprise its ancestry. There seems to be general agreement that the theory of graphs was born when Leonhard Euler published his solution to the "Konigsberg bridge prob- lem" in 1736 8]. Similarly, the year of birth for electrical...
"What good is a newborn baby?" Michael Faraday's reputed response when asked, "What good is magnetic induction?" But, it must be admitted that a newbo...
|
cena:
195,87 zł |
 |
Graphs and Networks: Transfinite and Nonstandard
ISBN: 9780817642921 / Angielski / Miękka / 202 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Scientia Gratiii Scientiae It is now thirteen years since the first book that discusses transfinite graphs and elec trical networks appeared 50]. This was followed by two more books 51] and 54] which compiled results from an ongoing research effort on that subject. Why then is a fourth book, this one, being offered? Simply because still more has been achieved beyond that appearing in those prior books. An exposition of these more recent re sults is the purpose of this book. The idea of transfiniteness for graphs and networks appeared as virgin research territory about seventeen years ago....
Scientia Gratiii Scientiae It is now thirteen years since the first book that discusses transfinite graphs and elec trical networks appeared 50]. Thi...
|
cena:
195,87 zł |
 |
Fundamentals of Domination in Graphs
ISBN: 9780824700331 / Angielski / Twarda / 464 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination.
Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results...
|
cena:
1314,21 zł |
 |
Minimal Networksthe Steiner Problem and Its Generalizations
ISBN: 9780849386428 / Angielski / Twarda / 432 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book focuses on the classic Steiner Problem and illustrates how results of the problem's development have generated the Theory of Minimal Networks, that is systems of "rubber" branching threads of minimal length. This theory demonstrates a brilliant interconnection among differential and computational geometry, topology, variational calculus, and graph theory. All necessary preliminary information is included, and the book's simplified format and nearly 150 illustrations and tables will help readers develop a concrete understanding of the material. All nontrivial statements are proved,...
This book focuses on the classic Steiner Problem and illustrates how results of the problem's development have generated the Theory of Minimal Network...
|
cena:
436,26 zł |
 |
Topological Structure and Analysis of Interconnection Networks
ISBN: 9781402000201 / Angielski / Twarda / 342 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The advent of very large scale integrated circuit technology has enabled the construction of very complex and large interconnection networks. By most accounts, the next generation of supercomputers will achieve its gains by increasing the number of processing elements, rather than by using faster processors. The most difficult technical problem in constructing a supercom puter will be the design of the interconnection network through which the processors communicate. Selecting an appropriate and adequate topological structure of interconnection networks will become a critical issue, on which...
The advent of very large scale integrated circuit technology has enabled the construction of very complex and large interconnection networks. By most ...
|
cena:
705,21 zł |
 |
Steiner Trees in Industry
ISBN: 9781402000997 / Angielski / Twarda / 507 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book is a collection of articles studying various Steiner tree prob- lems with applications in industries, such as the design of electronic cir- cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect- ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The...
This book is a collection of articles studying various Steiner tree prob- lems with applications in industries, such as the design of electronic cir- ...
|
cena:
783,57 zł |
 |
Fixed Point Theory: An Introduction
ISBN: 9781402003011 / Angielski / Miękka / 488 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Approach your problems from the right It isn't that they can't see the solution. It end and begin with the answers. Then, is that they can't see the problem. one day, perhaps you will find the final G. K. Chesterton, The Scandal of Father question. Brown 'The Point of a Pin'. 'The Hermit Clad in Crane Feathers' in R. Van Gulik's The Chinese Maze Murders. Growing specialization and diversification have brought a host of mono graphs and textbooks on increasingly specialized topics. However, the 'tree' of knowledge of mathematics and related fields does not grow only by putting forth new...
Approach your problems from the right It isn't that they can't see the solution. It end and begin with the answers. Then, is that they can't see the p...
|
cena:
195,87 zł |
 |
Toward an Anthropology of Graphing: Semiotic and Activity-Theoretic Perspectives
ISBN: 9781402013744 / Angielski / Twarda / 342 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. During the summer of 1990, while taking my holidays to teach a university course of physics for elementary teachers, I also tutored one of the tenth-grade students at my school in physics, chemistry, and mathematics. In return for working with him for free, I had requested permission to audiotape our sessions; I wanted to use the transcripts as data sources for a chapter that I had been in vited to write. It so happened that I discovered and read Jean Lave's Cognition in Practice that very summer, which inspired me to read other books on mathe matics in everyday situations. Two years later,...
During the summer of 1990, while taking my holidays to teach a university course of physics for elementary teachers, I also tutored one of the tenth-g...
|
cena:
391,77 zł |
 |
Toward an Anthropology of Graphing: Semiotic and Activity-Theoretic Perspectives
ISBN: 9781402013768 / Angielski / Miękka / 342 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. During the summer of 1990, while taking my holidays to teach a university course of physics for elementary teachers, I also tutored one of the tenth-grade students at my school in physics, chemistry, and mathematics. In return for working with him for free, I had requested permission to audiotape our sessions; I wanted to use the transcripts as data sources for a chapter that I had been in vited to write. It so happened that I discovered and read Jean Lave's Cognition in Practice that very summer, which inspired me to read other books on mathe matics in everyday situations. Two years later,...
During the summer of 1990, while taking my holidays to teach a university course of physics for elementary teachers, I also tutored one of the tenth-g...
|
cena:
391,77 zł |
 |
Graphing Calculator for Nys Math A... and Beyond
ISBN: 9781425101381 / Angielski / Miękka / 280 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The second book in this series, Graphing Calculator for NYS Math B? and Beyond, is also available from Trafford Publishing.
The second book in this series, Graphing Calculator for NYS Math B? and Beyond, is also available from Trafford Publishing.
|
cena:
109,24 zł |
 |
Graphing Calculator for Nys Math B... and Beyond
ISBN: 9781425102166 / Angielski / Miękka / 304 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Get a taste of the full power of the TI-83+/TI-84+ family of graphing calculators. Expands on skills learned in Graphing Calculator for NYS Math A ? and Beyond and continues on into matrices, programming, and more.
Get a taste of the full power of the TI-83+/TI-84+ family of graphing calculators. Expands on skills learned in Graphing Calculator for NYS Math A ? a...
|
cena:
131,13 zł |
 |
Spanning Trees and Optimization Problems
ISBN: 9781584884361 / Angielski / Twarda / 200 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under one cover spanning tree properties, classical results, and recent research developments.
Spanning Trees and Optimization Problems offers the first complete treatment of spanning tree algorithms, from their role in classical computer science to... The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also p...
|
cena:
630,82 zł |
 |
Graph Drawing: 10th International Symposium, GD 2002, Irvine, Ca, Usa, August 26-28, 2002, Revised Papers
ISBN: 9783540001584 / Angielski / Miękka / 398 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The 10th International Symposium on Graph Drawing (GD 2002) was held on August 26-28,2002, at Irvine, California. The conference attracted 74 parti- pants from academic and industrial institutions in 14 countries. As in previous years, the review process was competitive: 24 out of 48 regular submissions were accepted. In addition,9 short papers and 8 system demonst- tions (1 withdrawn) were also accepted. Each submission was refereed by at least 4 members of the program committee, and detailed comments were returned to the authors. GD 2002 invited two speakers: Frank Ruskey, from the...
The 10th International Symposium on Graph Drawing (GD 2002) was held on August 26-28,2002, at Irvine, California. The conference attracted 74 parti- p...
|
cena:
195,87 zł |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
