. .
Deutsch
Österreich
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.at

Dieses Buch teilen auf…
Buchtipps
Aktuelles
Tipp von eurobuch.at
Werbung
FILTER
- 0 Ergebnisse
Kleinster Preis: 89,90 €, größter Preis: 198,49 €, Mittelwert: 123,51 €
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
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 Hochschulschriften], Suedwestdeutscher Verlag fuer Hochschulschriften, 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., 5, Computers & Technology, 549726, Business Technology, 3448, Certification, 3508, Computer Science, 549646, Databases & Big Data, 6133988011, Digital Audio, Video & Photography, 87, Games & Strategy Guides, 4134, Graphics & Design, 549652, Hardware & DIY, 10806606011, History & Culture, 69766, Internet & Social Media, 377557011, Mobile Phones, Tablets & E-Readers, 3652, Networking & Cloud Computing, 3756, Operating Systems, 3839, Programming, 3952, Programming Languages, 377560011, Security & Encryption, 4053, Software, 3510, Web Development & Design, 1000, Subjects, 283155, Books, 468204, Computer Science, 491298, Algorithms, 491300, Artificial Intelligence, 491306, Database Storage & Design, 491308, Graphics & Visualization, 491302, Networking, 491310, Object-Oriented Software Design, 491312, Operating Systems, 491314, Programming Languages, 491316, Software Design & Engineering, 465600, New, Used & Rental Textbooks, 2349030011, Specialty Boutique, 283155, Books

Neues Buch Amazon.com
Book Depository US
Neuware Versandkosten:Usually ships in 1-2 business days, zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Isomorphism Testing for Restricted Graph Classes - Fabian Wagner
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
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-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. Books Books ~~ Computers~~ General Isomorphism-Testing-for-Restricted-Graph-Classes~~Fabian-Wagner AV Akademikerverlag GmbH & Co. KG. 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.

Neues Buch [USA] Barnesandnoble.com
Free Shipping on eligible orders over $25 Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
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 Hochschulschriften], Suedwestdeutscher Verlag fuer Hochschulschriften, The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the ver...., 71, Computing & Internet, 269189, Certification, 269265, Computer Science, 269899, Databases, 14288081, Digital Lifestyle, 14288151, Digital Music, 13731411, Digital Photography, 14263921, Digital Video, 269655, Hardware, 10781841, Mac OS, 269602, Microsoft Windows, 269520, Networking & Security, 403958, New to Computing, 408230, PC & Video Games, 14224461, Professionals, 269678, Programming, 269870, Software & Graphics, 269623, UNIX & Linux, 269406, Web Development, 1025612, Subjects, 266239, Books

Neues Buch Amazon.co.uk
BOOKS etc
Neuware Versandkosten:Europa Zone 1: GBP 5,48 pro Produkt.. Usually dispatched within 1-2 business days (EUR 6.75)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Isomorphism Testing for Restricted Graph Classes: On the complexity of isomorphism testing and reachability problems for restricted graph classes - Fabian Wagner
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
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

ID: 615345994

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

gebrauchtes bzw. antiquarisches Buch Biblio.com
Ergodebooks
Versandkosten: EUR 14.37
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Wagner, Fabian: Isomorphism Testing for Restricted Graph Classes - neues Buch

ISBN: 9783838119540

ID: 427302192

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 classes Bücher > English, International > Gebundene Ausgaben

Neues Buch eBook.de
No. 12662175 Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Details zum Buch
Isomorphism Testing for Restricted Graph Classes
Autor:

Wagner, Fabian

Titel:

Isomorphism Testing for Restricted Graph Classes

ISBN-Nummer:

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 02.07.2011 08:56:31
Buch zuletzt gefunden am 03.06.2017 10:57:03
ISBN/EAN: 9783838119540

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


< zum Archiv...
Benachbarte Bücher