Isomorphism Testing Restricted Graph by Wagner Fabian (5 results)
Language: English
Published by Südwestdeutscher Verlag für Hochschulschriften, 2015
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 66.03
£ 59.91 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Isomorphism Testing for Restricted Graph Classes | On the complexity of isomorphism testing and reachability problems for restricted graph classes | Fabian Wagner | Taschenbuch | 244 S. | Englisch | 2015 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838119540 | Verantwortliche Person für… die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Language: English
Published by Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Nov 2015, 2015
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 79.26
£ 19.69 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 bet…ween 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. 244 pp. Englisch.
Language: English
Published by Südwestdeutscher Verlag für Hochschulschriften, 2010
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 63.08
£ 41.93 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Wagner FabianFabian Wagner studied computer science at University of Ulm,he received his doctorate in 2010 from Institute of TheoreticalComputer Science in Ulm.The graph isomorphism problem (GI) consist…s of deciding whether there.
Language: English
Published by Südwestdeutscher Verlag Für Hochschulschriften Aug 2010, 2010
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 79.26
£ 51.35 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 244 pp. Englisch.
Language: English
Published by Südwestdeutscher Verlag Für Hochschulschriften, 2010
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 80.21
£ 52.99 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.
