- 0 Ergebnisse
Kleinster Preis: € 89,90, größter Preis: € 198,49, Mittelwert: € 123,51
1
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Bestellen
bei amazon.com
$ 120,00
(ca. € 107,79)
Bestellen
Fabian Wagner:

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

ISBN: 3838119541

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

Neuware Versandkosten:Usually ships in 1-2 business days, zzgl. Versandkosten

  - Book Depository US
2
Isomorphism Testing for Restricted Graph Classes - Fabian Wagner
Bestellen
bei BarnesandNoble.com
(ca. € 122,43)
Bestellen

Fabian Wagner:

Isomorphism Testing for Restricted Graph Classes - neues Buch

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

Free Shipping on eligible orders over $25 Versandkosten:zzgl. Versandkosten

3
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Bestellen
bei amazon.co.uk
£ 76,45
(ca. € 98,93)
Versand: € 6,75
Bestellen
Fabian Wagner:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Taschenbuch

ISBN: 3838119541

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

Neuware Versandkosten:Europa Zone 1: GBP 5,48 pro Produkt.. Usually dispatched within 1-2 business days (EUR 6.75)

  - BOOKS etc
Bezahlte Anzeige
4
Bestellen
bei Biblio.com
$ 220,97
(ca. € 198,49)
Versand: € 14,37
Bestellen
Fabian Wagner:
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Taschenbuch

2010, ISBN: 9783838119540

Suedwestdeutscher Verlag fuer Hochschulschriften, 2010-08-26. Paperback. Used:Good. Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. Expedite Shipping Av… Mehr…

Versandkosten: EUR 14.37

  - Ergodebooks
5
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes
Bestellen
bei eBook.de
€ 89,90
Bestellen
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes - neues Buch

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

No. 12662175 Versandkosten:zzgl. Versandkosten

  -

Details zum Buch
Isomorphism Testing for Restricted Graph Classes

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.

Detailangaben zum Buch - Isomorphism Testing for Restricted Graph Classes


EAN (ISBN-13): 9783838119540
ISBN (ISBN-10): 3838119541
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Südwestdeutscher Verlag
244 Seiten
Gewicht: 0,380 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2011-07-02T08:56:31+02:00 (Vienna)
Detailseite zuletzt geändert am 2017-06-03T10:57:03+02:00 (Vienna)
ISBN/EAN: 9783838119540

ISBN - alternative Schreibweisen:
3-8381-1954-1, 978-3-8381-1954-0


< zum Archiv...