- 5 Resultados
precio mínimo: € 89,90, precio máximo: € 115,41, precio promedio: € 102,96
1
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Pedir
por amazon.com
$ 120,00
(aprox. € 107,79)
Pedir
Detalles y envío
Enlace patrocinado
Fabian Wagner:

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

ISBN: 3838119541

Paperback, [EAN: 9783838119540], Suedwestdeutscher Verlag fuer Hochschulschriften, Suedwestdeutscher Verlag fuer Hochschulschriften, Book, [PU: Suedwestdeutscher Verlag fuer Hochschulschr… Más…

  - Neuware Gastos de envío:Usually ships in 1-2 business days, más gastos de envío Book Depository US
cerrar (X)
2
Isomorphism Testing for Restricted Graph Classes - Fabian Wagner
Pedir
por Hugendubel.de
€ 89,99
Pedir
Detalles y envío
Enlace patrocinado

Fabian Wagner:

Isomorphism Testing for Restricted Graph Classes - Pasta blanda

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… Más…

Gastos de envío:Does not ship to your country., más gastos de envío
cerrar (X)
3
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Wagner, Fabian
Pedir
por amazon.com
$ 120,00
(aprox. € 111,69)
Envío: € 3,711
Pedir
Detalles del proveedor
Enlace patrocinado
Wagner, Fabian:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Pasta blanda

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… Más…

Gastos de envío:Real shipping costs can differ from the ones shown here. (EUR 3.71)
cerrar (X)
4
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Wagner, Fabian
Pedir
por amazon.com
$ 124,00
(aprox. € 115,41)
Envío: € 0,001
Pedir
Detalles del proveedor
Enlace patrocinado
Wagner, Fabian:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Pasta blanda

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… Más…

Gastos de envío:In Stock. Lieferung von Amazon. (EUR 0.00) Amazon.com
cerrar (X)
5
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes
Pedir
por eBook.de
€ 89,90
Pedir
Detalles y envío
Enlace patrocinado
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes - libro nuevo

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… Más…

  - No. 12662175 Gastos de envío:zzgl. Versandkosten, más gastos de envío
cerrar (X)
1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Isomorphism Testing for Restricted Graph Classes
Autor:
Título:
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.

Detalles del libro - Isomorphism Testing for Restricted Graph Classes


EAN (ISBN-13): 9783838119540
ISBN (ISBN-10): 3838119541
Tapa blanda
Año de publicación: 2010
Editorial: Südwestdeutscher Verlag für Hochschulschriften AG Co. KG
244 Páginas
Peso: 0,380 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2011-07-02T08:56:31+02:00 (Madrid)
Página de detalles modificada por última vez el 2023-05-31T14:47:33+02:00 (Madrid)
ISBN/EAN: 9783838119540

ISBN - escritura alterna:
3-8381-1954-1, 978-3-8381-1954-0
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: wagner
Título del libro: complexity testing, wagner

< para archivar...