Graph Isomorphism Algorithms
by Daniel Baggenstos (9783836469456)

Graph Isomorphism Algorithms

Daniel Baggenstos

Release Date: 01 December 2008
Format: Paperback
Pages: 80
Category: Engineering
Publisher: VDM Verlag
ISBN: 9783836469456
ISBN-10: 3836469456

This thesis introduces similarity measures to be used by comparing XML workflows and RDF or OWL structures. These structures are accessed and converted into a generic graph representation. Two graphs are compared by a measure to conclude in a single value indicating the similarity of the graphs. Similarity is calculated by two different similarity measures, the graph isomorphism measure and the subgraph isomorphism measure. The graph isomorphism measure detects structurally identical graphs and calculates the similarity upon the nearness of the node labels. Structurally different graphs are compared by the subgraph isomorphism measure to find matching parts. The size and the label similarity of the nodes of a matched part contribute to its similarity based upon the compared graphs. The highest similarity value of all parts is defined to be the similarity of the two graphs. Performance improvements were developed and implemented which led to a decreasing runtime. Further improvements were analyzed and proposed to be implemented at a later date.

AUD $93.95

 This title is not held in stock & is ordered from suppliers, subject to availability.

Write a customer review of Graph Isomorphism Algorithms.

If you like this title please tell others:

tell others

post to your Facebook wall post on Twitter post on Digg recommend to Stumbleupon bookmark on Delicious RSS feed send to a friend

Australian BookShop
Australian Bookshop. Established 2003
Shopping Cart Customer Support

International Online Store
of Inspiration
we ship everywhere
Australia Post
Australia Wide