topmenu
Wyniki wyszukiwania:
wyszukanych pozycji: 10
 |
The Hamiltonian Circuit Algorithm
ISBN: 9781466381377 / Angielski / Miękka / 2011 / 34 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half the total number of vertices. In the process, we also obtain a constructive proof of Dirac's famous theorem of 1952, for the first time. The algorithm finds a Hamiltonian circuit (respectively, tour) in all known examples of graphs that have a Hamiltonian circuit (respectively, tour). In view of the importance of the P versus NP question, we ask: does there exist a...
We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circu...
|
cena:
66,64 zł |
 |
The Independent Set Algorithm
ISBN: 9781466387690 / Angielski / Miękka / 2011 / 46 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum independent set in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum independent set. The algorithm is demonstrated by finding maximum independent sets for several famous graphs, including two large benchmark...
We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey n...
|
cena:
66,64 zł |
 |
The Vertex Coloring Algorithm
ISBN: 9781466391321 / Angielski / Miękka / 2011 / 54 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and maximum vertex degree Delta must have chromatic number Chi(G) less than or equal to Delta+1 and that the algorithm will always find a proper m-coloring of the vertices of G with m less than or equal to Delta+1. Furthermore, we prove that this condition is the best possible in terms of n and Delta by explicitly constructing graphs for which the chromatic number is exactly Delta+1. In the special case when G is a connected simple graph and is...
We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and ma...
|
cena:
75,54 zł |
 |
The Vertex Cover Algorithm
ISBN: 9781466384477 / Angielski / Miękka / 2011 / 46 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a minimum vertex cover. The algorithm is demonstrated by finding minimum vertex covers for several famous graphs, including two large benchmark graphs with hidden minimum vertex covers. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.
We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover in all known exampl...
|
cena:
66,64 zł |
 |
The Clique Algorithm
ISBN: 9781466391215 / Angielski / Miękka / 2011 / 48 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum clique. The algorithm is demonstrated by finding maximum cliques for several famous graphs, including two large benchmark graphs with hidden maximum cliques. We...
We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in...
|
cena:
66,64 zł |
 |
The Grand Unification
ISBN: 9781466272316 / Angielski / Miękka / 2011 / 130 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We show that the mathematical proof of the four colour theorem directly implies the existence of the standard model together with quantum gravity in its physical interpretation. Conversely, the experimentally observable standard model and quantum gravity show that nature applies the mathematical proof of the four colour theorem at the most fundamental level. We preserve all the established working theories of physics: Quantum Mechanics, Special and General Relativity, Quantum Electrodynamics (QED), the Electroweak model and Quantum Chromodynamics (QCD). We build upon these theories, unifying...
We show that the mathematical proof of the four colour theorem directly implies the existence of the standard model together with quantum gravity in i...
|
cena:
177,72 zł |
 |
The Four Colour Theorem
ISBN: 9781466265301 / Angielski / Miękka / 2011 / 82 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We present a new proof of the famous four colour theorem using algebraic and topological methods. This proof was first announced by the Canadian Mathematical Society in 2000 and subsequently published by Orient Longman and Universities Press of India in 2008. Recent research in physics shows that this proof directly implies the Grand Unification of the Standard Model with Quantum Gravity in its physical interpretation and conversely the existence of the standard model of particle physics shows that nature applies this proof of the four colour theorem at the most fundamental level.
We present a new proof of the famous four colour theorem using algebraic and topological methods. This proof was first announced by the Canadian Mathe...
|
cena:
111,08 zł |
 |
Space, Time and Matter
ISBN: 9781466403925 / Angielski / Miękka / 2011 / 100 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. We show how the grand unified theory based on the proof of the four color theorem can be obtained entirely in terms of the Poincare group of isometries of space and time. Electric and gauge charges of all the particles of the standard model can now be interpreted as elements of the Poincare group. We define the space and time chiralities of all spin 1/2 fermions in agreement with Dirac's relativistic wave equation. All the particles of the standard model now correspond to irreducible representations of the Poincare group according to Wigner's classification. Finally, we construct the Steiner...
We show how the grand unified theory based on the proof of the four color theorem can be obtained entirely in terms of the Poincare group of isometrie...
|
cena:
111,08 zł |
 |
Applications of Graph Theory
ISBN: 9781466397095 / Angielski / Miękka / 2011 / 32 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. Graph theory is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in fields as varied as biochemistry (genomics), electrical engineering (communication networks and coding theory), computer science (algorithms and computation) and operations research (scheduling). The powerful combinatorial methods found in graph theory have also been used to prove fundamental results in other areas of pure mathematics. This book, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's...
Graph theory is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in...
|
cena:
66,64 zł |
 |
Graph Theory
ISBN: 9781466254992 / Angielski / Miękka / 2011 / 474 str. Termin realizacji zamówienia: ok. 13-18 dni roboczych. This text offers the most comprehensive and up-to-date presentation available on the fundamental topics in graph theory. It develops a thorough understanding of the structure of graphs, the techniques used to analyze problems in graph theory and the uses of graph theoretical algorithms in mathematics, engineering and computer science. There are many new topics in this book that have not appeared before in print: new proofs of various classical theorems, signed degree sequences, criteria for graphical sequences, eccentric sequences, matching and decomposition of planar graphs into trees....
This text offers the most comprehensive and up-to-date presentation available on the fundamental topics in graph theory. It develops a thorough unders...
|
cena:
111,08 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
