Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Isomorphism Testing for Restricted Graph Classes

Name: Isomorphism Testing for Restricted Graph Classes
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
SKU: 07012021
Price: 31824 HUF
Availability: InStock
Author: Fabian Wagner
ISBN: 9783838119540

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

Fabian Wagner

Language

English

Book Paperback

Libristo code: 07012021

Publishers Sudwestdeutscher Verlag Fur Hochschulschriften AG, August 2010

The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the ver... Full description

Libristo code: 07012021

212 b

31 824 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Contribution A l'Etude Du Mal Perforant, Etiologie Multiple FAURE-J

Paperback

6 084 Ft

Galerie Du Palais-Royal Gravee. Ecole Venitienne, Genoise, Napolitaine, Flamande Louis-Abel Fontenay

Paperback

8 714 Ft

Logistikleitfaden Martina Alexyová

Paperback

18 153 Ft

Les Paradoxes Du Capitaine Marc-Luc-Roch Barole. Tome 2 De M-P

Paperback

7 004 Ft

Gesprach zweier selbst uberlegender evangelischer Christen uber die Schrift Friedrich Schleiermacher

Hardback

46 973 Ft

Lernzirkel Sport IV: Turnen lernen an Stationen Julia Bracke

Sheet

7 544 Ft

Textbook of Plastic, Reconstructive, and Aesthetic Surgery, Vol 5: Burns Vinita Puri

Hardback

64 657 Ft

J. GORDON CAMERON: SIX PRELUDES ON HYMN TUNES FOR ORGAN CAMERON Book

binding.

7 586 Ft

Opuscules monastiques - tome 1 Hildegarde de Bingen

Paperback

19 608 Ft

KUNTH FlexiMap Magnum Kuba 1:800000 neuvedený autor

Map

2 630 Ft

36 and 6 cat detectives Galina Vdovichenko

Hardback

7 108 Ft

secolo in corriera lungo la Statale 45 Corrado Bozzano

Paperback

12 936 Ft

Erdoelpolitik der USA unter der Administration von George W. Bush Kevin Krippner

Paperback

17 026 Ft

Lieselotte macht nicht mit Thomas Lotz

Audio CD

4 449 Ft

Evaluacion de la calidad de los programas educativos Edgar Oliver Cardoso Espinosa

Paperback

10 339 Ft

Internet in Der Schule Hiltrud Westram

Paperback

20 963 Ft

LE SOLEIL NE SE LEVA PAS André DAHL

Paperback

3 800 Ft

ORGANISATION NARCISSIQUE A.

Paperback

9 524 Ft

Un Moyen Age en images (Les incontournables Hazan) Jacques Le Goff

Book

11 780 Ft

Flashcards L'arabe pour les Nuls Alma Abou Fakher

Hardback

6 700 Ft

Génération Ocasio-Cortez - Les nouveaux activistes américains Mathieu Magnaudeix

Paperback

8 686 Ft

Sicher in Alltag und Beruf! C1. Medienpaket Magdalena Matussek

Audio CD

15 614 Ft

Urogenitale Infektionen Alfons Hofstetter

Paperback

23 214 Ft

Das Buch von T(H)ale Thomas Helgerth

Paperback

3 980 Ft

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.