Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
L'autore
Vahan Mkrtchyan, PhD in Mathematics. My main research area is graph theory. Currently, I teach at Yerevan State University.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per On special maximum matching constructing: Algorithms...
Immagini fornite dal venditore
On special maximum matching constructing
Editore:
LAP LAMBERT Academic Publishing Aug 2012, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 172 pp. Englisch. Codice articolo 9783659219146
Compra nuovo
EUR 68,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
On special maximum matching constructing
Editore:
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Mkrtchyan VahanVahan Mkrtchyan, PhD in Mathematics. My main research area is graph theory. Currently, I teach at Yerevan State University.Problem of existence and construction of matchings in various classes of graphs is one of t. Codice articolo 5140642
Compra nuovo
EUR 55,21
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
On special maximum matching constructing
Editore:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 172. Codice articolo 26127004846
Compra nuovo
EUR 107,58
Spedizione EUR 3,49
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 4 disponibili
Foto dell'editore
On special maximum matching constructing
Editore:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Brossura
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. 172 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Codice articolo 132534129
Compra nuovo
EUR 111,07
Spedizione EUR 7,65
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
On special maximum matching constructing
Editore:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Brossura
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 172. Codice articolo 18127004836
Compra nuovo
EUR 111,45
Spedizione EUR 9,95
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
On special maximum matching constructing | Algorithms and Complexity
Editore:
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Taschenbuch
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. On special maximum matching constructing | Algorithms and Complexity | Vahan Mkrtchyan | Taschenbuch | 172 S. | Englisch | 2012 | LAP LAMBERT Academic Publishing | EAN 9783659219146 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 106309160
Compra nuovo
EUR 58,00
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
On special maximum matching constructing
Editore:
LAP LAMBERT Academic Publishing Aug 2012, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 172 pp. Englisch. Codice articolo 9783659219146
Compra nuovo
EUR 68,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
On special maximum matching constructing : Algorithms and Complexity
Editore:
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659219142
ISBN 13: 9783659219146
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9783659219146
Compra nuovo
EUR 68,00
Spedizione EUR 61,37
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili