» książki » Mathematics - Graphic Methods
topmenu
 |
Topics in Algebraic Graph Theory
ISBN: 9780521801973 / Angielski / Twarda / 294 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. Peter J. Cameron,...
The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra...
|
cena:
539,90 |
 |
Random Graphs
ISBN: 9780521809207 / Angielski / Twarda / 520 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up-to-date and comprehensive account of random graph theory. The theory estimates the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert...
This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The ...
|
cena:
952,85 |
 |
Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2
ISBN: 9780521836630 / Angielski / Miękka / 310 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Line graphs have the property that their least eigenvalue is greater than, or equal to, -2, a property shared by generalized line graphs and a finite number of so-called exceptional graphs. This book deals with all these families of graphs in the context of their spectral properties. Technical descriptions of these graphs are included in the appendices, while the bibliography provides over 250 references. It will be an important resource for all researchers with an interest in algebraic graph theory.
Line graphs have the property that their least eigenvalue is greater than, or equal to, -2, a property shared by generalized line graphs and a finite ...
|
cena:
376,03 |
 |
Crossing Numbers of Graphs
ISBN: 9781498750493 / Angielski / Twarda / 350 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
587,73 |
 |
Decompositions of Graphs
ISBN: 9780792307471 / Angielski / Twarda / 248 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This nice text (twenty years in the writing, published posthumously) would serve well to introduce graduate students (those who can afford it ) to a rich and important class of graph-theoretic problems and concepts. Fifteen short chapters (under three broad topical heads), to each of which are attac
This nice text (twenty years in the writing, published posthumously) would serve well to introduce graduate students (those who can afford it ) to a r...
|
cena:
483,04 |
![Cycles and Bridges in Graphs Heinz-Jurgen Voss Heinz-J]rgen Voss 9780792308997 Springer](/9780792308997_cycles_and_bridges_in_graphs.jpg "Cycles and Bridges in Graphs") |
Cycles and Bridges in Graphs
ISBN: 9780792308997 / Angielski / Twarda / 272 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
402,53 |
 |
One-Factorizations
ISBN: 9780792343233 / Angielski / Twarda / 242 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to...
This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered...
|
cena:
201,24 |
 |
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:
805,10 |
 |
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:
925,87 |
 |
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:
402,53 |
 |
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:
402,53 |
 |
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:
1811,52 |
 |
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:
402,53 |
 |
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:
502,01 |
 |
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:
201,24 |
 |
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:
201,24 |
 |
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:
1346,88 |
 |
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:
426,05 |
 |
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:
724,58 |
 |
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:
805,10 |
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
