Häftad, Engelska, 2020
129 kr
Skickas inom 5-8 vardagar
Joe Ryan – författare
Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.
10 produkter
10 produkter
- Häftad, Engelska, 2013
434 kr
Skickas inom 5-8 vardagar
This work covers the individuals and events of what most consider to be the greatest era in boxing history. The first chapter compares the 1970s to all other eras, from the early 1900s and Jack Johnson to the present day and the Klitschko brothers, proving through an established set of criteria that the '70s stand above all other eras. The second chapter focuses on the tumultuous 1960s and the circumstances that led to the blossoming of unprecedented competition.The remaining ten chapters cover the years 1970 through 1979, revisiting the people and the rivalries of an era that produced Ali, Frazier, Foreman, Norton and Holmes, boxers known to people who didn't even follow the sport. - Häftad, Engelska, 2004
261 kr
Skickas inom 5-8 vardagar
- Häftad, Engelska, 2005
223 kr
Skickas inom 5-8 vardagar
- Häftad, Engelska, 2007
262 kr
Skickas inom 5-8 vardagar
- Del 60 - Developments in Mathematics
Magic and Antimagic Graphs
Attributes, Observations and Challenges in Graph Labelings
Inbunden, Engelska, 20191 517 kr
Skickas inom 10-15 vardagar
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond.Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph.Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists. - E-bokEngelska, 2019
1 886 kr
Läs direkt efter köp
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond.
Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph.
Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.
- Del 60 - Developments in Mathematics
Magic and Antimagic Graphs
Attributes, Observations and Challenges in Graph Labelings
Häftad, Engelska, 20201 517 kr
Skickas inom 10-15 vardagar
Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond.Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph.Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists. - Del 10765 - Lecture Notes in Computer Science
Combinatorial Algorithms
28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
Häftad, Engelska, 2018546 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms. - E-bokEngelska, 2018
710 kr
Läs direkt efter köp
This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.
