- 5 resultados
menor preço: € 89.90, preço mais alto: € 115.41, preço médio: € 102.96
1
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Encomendar
no/na amazon.com
$ 120.00
(aproximadamente € 107.79)
Encomendar
Detalhes e envio
Link patrocinado
Fabian Wagner:

Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Livro de bolso

ISBN: 3838119541

Paperback, [EAN: 9783838119540], Suedwestdeutscher Verlag fuer Hochschulschriften, Suedwestdeutscher Verlag fuer Hochschulschriften, Book, [PU: Suedwestdeutscher Verlag fuer Hochschulschr… mais…

  - Neuware Custos de envio:Usually ships in 1-2 business days, mais custos de envio Book Depository US
fechar(X)
2
Isomorphism Testing for Restricted Graph Classes - Fabian Wagner
Encomendar
no/na Hugendubel.de
€ 89.99
Encomendar
Detalhes e envio
Link patrocinado

Fabian Wagner:

Isomorphism Testing for Restricted Graph Classes - Livro de bolso

ISBN: 9783838119540

*Isomorphism Testing for Restricted Graph Classes* - On the complexity of isomorphism testing and reachability problems for restricted graph classes / Taschenbuch für 89.99 € / Aus dem Be… mais…

Custos de envio:Does not ship to your country., mais custos de envio
fechar(X)
3
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Wagner, Fabian
Encomendar
no/na amazon.com
$ 120.00
(aproximadamente € 111.69)
Envio: € 3.711
Encomendar
Detalhes fornecedor
Link patrocinado
Wagner, Fabian:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Livro de bolso

2010

ISBN: 9783838119540

Suedwestdeutscher Verlag fuer Hochschulschriften, Paperback, 244 Seiten, Publiziert: 2010-08-26T00:00:01Z, Produktgruppe: Book, 0.36 kg, Computers & Technology, Subjects, Books, Suedwestd… mais…

Custos de envio:Real shipping costs can differ from the ones shown here. (EUR 3.71)
fechar(X)
4
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Wagner, Fabian
Encomendar
no/na amazon.com
$ 124.00
(aproximadamente € 115.41)
Envio: € 0.001
Encomendar
Detalhes fornecedor
Link patrocinado
Wagner, Fabian:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Livro de bolso

2010, ISBN: 9783838119540

Suedwestdeutscher Verlag fuer Hochschulschriften, Paperback, 244 Seiten, Publiziert: 2010-08-26T00:00:01Z, Produktgruppe: Book, 0.36 kg, Computers & Technology, Subjects, Books, Suedwestd… mais…

Custos de envio:In Stock. Lieferung von Amazon. (EUR 0.00) Amazon.com
fechar(X)
5
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes
Encomendar
no/na eBook.de
€ 89.90
Encomendar
Detalhes e envio
Link patrocinado
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes - nuovo livro

ISBN: 9783838119540

On the complexity of isomorphism testing and reachability problems for restricted graph classes On the complexity of isomorphism testing and reachability problems for restricted graph cla… mais…

  - No. 12662175 Custos de envio:zzgl. Versandkosten, mais custos de envio
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
Isomorphism Testing for Restricted Graph Classes
Autor:
Título:
Número ISBN:

9783838119540


The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the vertices of two graphs, which preserves the adjacency relations. GI is not known to be NP-complete nor to be in P. The enormous gap between the known upper and lower bound has motivated a study of isomorphism restricted to special classes of graphs where this gap can be reduced. We prove for the classes of planar graphs, K_{3,3}-minor free and K_5-minor free graphs, that isomorphism testing is in logspace. For graphs of bounded treewidth we prove a new upper bound LogCFL. We also consider the complexity of the isomorphism problem when groups or quasigroups are given in table representation. Because of all these results in the context of logarithmic space complexity classes we also consider reachability problems. Reachability is a widely studied problem especially in the space setting, it asks in a directed graph with two designated vertices s and t whether there is a path from s to t. We improve some upper bounds of the reachability problems for the mentioned graph classes.

Dados detalhados do livro - Isomorphism Testing for Restricted Graph Classes


EAN (ISBN-13): 9783838119540
ISBN (ISBN-10): 3838119541
Livro de bolso
Ano de publicação: 2010
Editor/Editora: Südwestdeutscher Verlag für Hochschulschriften AG Co. KG
244 Páginas
Peso: 0,380 kg
Língua: eng/Englisch

Livro na base de dados desde 2011-07-02T03:56:31-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2023-05-31T09:47:33-03:00 (Sao Paulo)
Número ISBN/EAN: 9783838119540

Número ISBN - Ortografia alternativa:
3-8381-1954-1, 978-3-8381-1954-0
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: wagner
Título do livro: complexity testing, wagner

< Para arquivar...