Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Kuriér GLS 3.99 € Zberné miesto GLS 2.49 € SPS 3.99 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Slovenská pošta 3.99 € Zberné miesto DPD 2.99 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Isomorphism Testing for Restricted Graph Classes

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

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

Fabian Wagner

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 07012021

Nakladateľstvo Sudwestdeutscher Verlag Fur Hochschulschriften AG, august 2010

The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the ver... Celý popis

Libristo kód: 07012021

194 b

79.77 €

Skladom u dodávateľa Odosielame za 5-8 dní

Až 30 dní na vrátenie tovaru

Zákazníci tiež kúpili

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

Brožovaná

14.72 €

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

Brožovaná

22.79 €

Logistikleitfaden Martina Alexyová

Brožovaná

49.82 €

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

Brožovaná

18.15 €

Gesprach zweier selbst uberlegender evangelischer Christen uber die Schrift Friedrich Schleiermacher

Pevná

118.81 €

Lernzirkel Sport IV: Turnen lernen an Stationen Julia Bracke

List

18.95 €

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

Pevná

177.31 €

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

binding.

20.77 €

Opuscules monastiques - tome 1 Hildegarde de Bingen

Brožovaná

53.75 €

KUNTH FlexiMap Magnum Kuba 1:800000 neuvedený autor

Mapa

6.14 €

36 and 6 cat detectives Galina Vdovichenko

Pevná

16.63 €

secolo in corriera lungo la Statale 45 Corrado Bozzano

Brožovaná

32.57 €

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

Brožovaná

42.66 €

Lieselotte macht nicht mit Thomas Lotz

Audio CD

11.09 €

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

Brožovaná

25.91 €

Internet in Der Schule Hiltrud Westram

Brožovaná

52.94 €

LE SOLEIL NE SE LEVA PAS André DAHL

Brožovaná

10.38 €

ORGANISATION NARCISSIQUE A.

Brožovaná

26.11 €

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

Kniha

32.27 €

Flashcards L'arabe pour les Nuls Alma Abou Fakher

Pevná

17.54 €

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

Brožovaná

23.79 €

Sicher in Alltag und Beruf! C1. Medienpaket Magdalena Matussek

Audio CD

39.43 €

Urogenitale Infektionen Alfons Hofstetter

Brožovaná

60.61 €

Das Buch von T(H)ale Thomas Helgerth

Brožovaná

9.98 €

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.