- 5 Results
Lowest price: € 59.78, highest price: € 74.95, average price: € 67.67
1
On special maximum matching constructing - Vahan Mkrtchyan
Order
at AbeBooks.de
$ 72.64
(aprox. € 67.81)
Shipment: € 21.351
OrderSponsored link
Vahan Mkrtchyan:

On special maximum matching constructing - Paperback

2012, ISBN: 3659219142

[EAN: 9783659219146], Neubuch, [PU: LAP LAMBERT Academic Publishing Aug 2012], This item is printed on demand - it takes 3-4 days longer - Neuware -Problem of existence and construction o… More...

NEW BOOK. Shipping costs: EUR 21.35 BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
2
On special maximum matching constructing: Algorithms and Complexity - Mkrtchyan, Vahan
Order
at amazon.de
€ 67.81
Shipment: € 0.001
OrderSponsored link

Mkrtchyan, Vahan:

On special maximum matching constructing: Algorithms and Complexity - Paperback

2012, ISBN: 9783659219146

LAP LAMBERT Academic Publishing, Taschenbuch, 172 Seiten, Publiziert: 2012-08-28T00:00:01Z, Produktgruppe: Buch, 0.26 kg, Mathematik, Naturwissenschaften & Technik, Kategorien, Bücher, Ta… More...

Shipping costs:Auf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
3
On special maximum matching constructing: Algorithms and Complexity - Mkrtchyan, Vahan
Order
at amazon.de
€ 59.78
Shipment: € 3.001
OrderSponsored link
Mkrtchyan, Vahan:
On special maximum matching constructing: Algorithms and Complexity - Paperback

2012

ISBN: 9783659219146

LAP LAMBERT Academic Publishing, Taschenbuch, 172 Seiten, Publiziert: 2012-08-28T00:00:01Z, Produktgruppe: Buch, 0.26 kg, Mathematik, Naturwissenschaften & Technik, Kategorien, Bücher, Ta… More...

Shipping costs:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
4
Order
at AbeBooks.de
$ 80.29
(aprox. € 74.95)
Shipment: € 0.001
OrderSponsored link
Mkrtchyan, Vahan:
On special maximum matching constructing Algorithms and Complexity - Paperback

2012, ISBN: 3659219142

[EAN: 9783659219146], Neubuch, [PU: LAP LAMBERT Academic Publishing], New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000., Books

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) PBShop.store US, Wood Dale, IL, U.S.A. [8408184] [Rating: 5 (von 5)]
5
On special maximum matching constructing Algorithms and Complexity - Mkrtchyan, Vahan
Order
at Achtung-Buecher.de
€ 68.00
Shipment: € 0.001
OrderSponsored link
Mkrtchyan, Vahan:
On special maximum matching constructing Algorithms and Complexity - new book

2012, ISBN: 3659219142

Kartoniert / Broschiert, mit Schutzumschlag 11, [PU:LAP LAMBERT Academic Publishing]

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien

1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by euro-book.co.uk / euro-book.co.uk do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
On special maximum matching constructing: Algorithms and Complexity

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 str

Details of the book - On special maximum matching constructing: Algorithms and Complexity


EAN (ISBN-13): 9783659219146
ISBN (ISBN-10): 3659219142
Hardcover
Paperback
Publishing year: 2012
Publisher: LAP LAMBERT Academic Publishing

Book in our database since 2007-06-25T06:15:24+01:00 (London)
Detail page last modified on 2023-10-18T10:24:34+01:00 (London)
ISBN/EAN: 3659219142

ISBN - alternate spelling:
3-659-21914-2, 978-3-659-21914-6
Alternate spelling and related search-keywords:
Book author: vahan
Book title: complexity algorithms


< to archive...