- 5 resultados
menor preço: € 59.78, preço mais alto: € 74.95, preço médio: € 67.67
1
On special maximum matching constructing - Vahan Mkrtchyan
Encomendar
no/na AbeBooks.de
$ 72.64
(aproximadamente € 67.81)
Envio: € 21.351
Encomendar
Detalhes fornecedor
Link patrocinado
Vahan Mkrtchyan:

On special maximum matching constructing - Livro de bolso

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… mais…

NEW BOOK. Custos de envio: EUR 21.35 BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
fechar(X)
2
On special maximum matching constructing: Algorithms and Complexity - Mkrtchyan, Vahan
Encomendar
no/na amazon.de
€ 67.81
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado

Mkrtchyan, Vahan:

On special maximum matching constructing: Algorithms and Complexity - Livro de bolso

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… mais…

Custos de envio:Auf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
fechar(X)
3
On special maximum matching constructing: Algorithms and Complexity - Mkrtchyan, Vahan
Encomendar
no/na amazon.de
€ 59.78
Envio: € 3.001
Encomendar
Detalhes fornecedor
Link patrocinado
Mkrtchyan, Vahan:
On special maximum matching constructing: Algorithms and Complexity - Livro de bolso

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… mais…

Custos de envio:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
fechar(X)
4
Encomendar
no/na AbeBooks.de
$ 80.29
(aproximadamente € 74.95)
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado
Mkrtchyan, Vahan:
On special maximum matching constructing Algorithms and Complexity - Livro de bolso

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. Custos de envio:Versandkostenfrei. (EUR 0.00) PBShop.store US, Wood Dale, IL, U.S.A. [8408184] [Rating: 5 (von 5)]
fechar(X)
5
On special maximum matching constructing Algorithms and Complexity - Mkrtchyan, Vahan
Encomendar
no/na Achtung-Buecher.de
€ 68.00
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado
Mkrtchyan, Vahan:
On special maximum matching constructing Algorithms and Complexity - nuovo livro

2012, ISBN: 3659219142

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

Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
fechar(X)
1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do item, de uma possível adesão à plataforma, de uma entrega direta pela plataforma ou através de um fornecedor terceirizado (Marketplace), etc., é possível que os custos de envio indicados pela terralivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
On special maximum matching constructing: Algorithms and Complexity
Autor:
Título:
Número ISBN:

3659219142


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

Dados detalhados do livro - On special maximum matching constructing: Algorithms and Complexity


EAN (ISBN-13): 9783659219146
ISBN (ISBN-10): 3659219142
Livro de capa dura
Livro de bolso
Ano de publicação: 2012
Editor/Editora: LAP LAMBERT Academic Publishing

Livro na base de dados desde 2007-06-25T02:15:24-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2023-10-18T06:24:34-03:00 (Sao Paulo)
Número ISBN/EAN: 3659219142

Número ISBN - Ortografia alternativa:
3-659-21914-2, 978-3-659-21914-6
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: vahan
Título do livro: complexity algorithms

< Para arquivar...