On special maximum matching constructing: Algorithms and Complexity - Vahan Mkrtchyan
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
Problem of existence and construction of matchings in various classes of graphs is one of the well-known and important directions of research carried out in Discrete Mathematics. The subject stems from the prominent ¿Marriage Problem¿ which is a problem of existence and construction of a system of distinct representatives, for which necessary and sufficient condition is found. The interest towards problems ... Full description
You May Also Like
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-20% with code BOOKS
In stock at our supplier
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-20% with code BOOKS
In stock at our supplier
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-20% with code BOOKS
In stock at our supplier
TOP
How to Solve it: A New Aspect of Mathematical Method
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
The Brain That Changes Itself: Stories of Personal Triumph from the Frontiers of Brain Science
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
Description
Problem of existence and construction of matchings in various classes of graphs is one of the well-known and important directions of research carried out in Discrete Mathematics. The subject stems from the prominent ¿Marriage Problem¿ which is a problem of existence and construction of a system of distinct representatives, for which necessary and sufficient condition is found. The interest towards problems which are related to matchings is explained not only by their theoretical importance, but also by the essential role that matchings play in the various, sometimes unexpected applications of Combinatorial Mathematics in development of methods for solving various practical problems. In the present work the influence of a maximum matching of the given graph on the graph obtained by its removal is investigated. The work can be interesting to researchers who work especially with matchings and related structures.
More Information
| Author | Vahan Mkrtchyan |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2012 |
| Cover type | Softcover |
| EAN | 9783659219146 |