Special Maximum Matching Constructing by Mkrtchyan Vahan (8 results)

Condition: New. pp. 172.

Taschenbuch. Condition: 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.

Taschenbuch. Condition: 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.

Condition: 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.

Condition: 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.

Condition: New. PRINT ON DEMAND pp. 172.

Taschenbuch. Condition: 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.

Taschenbuch. Condition: 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.