Canonical Graph Decomposition in Matching

Show full item record

Title: Canonical Graph Decomposition in Matching
Author: Yaghi, Haytham H
Advisors: Dr. Huaiyu Dai, Committee Member
Dr. Carla Savage, Committee Member
Dr. Hamid Krim, Committee Chair
Abstract: In the following thesis, we present our proposed probabilistic approach to the graph isomorphism problem. Through a "divide and conquer" approach, a graph is first decomposed into unique subgraphs, termed atoms, that are used to represent a decomposed graph as a bipartite attributed graph. We propose a modified probabilistic relaxation that simulates belief propagation and operates on the generated bipartite graph, yielding a match matrix that maps together isomorphic atoms from different graphs. Our proposed approach enforces a two way matching constraint thatguarantees a one-to-one match between isomorphic atoms. On average, the approach converges for isomorphic graphs and diverges for non-isomorphic graphs.
Date: 2009-04-15
Degree: MS
Discipline: Electrical Engineering

Files in this item

Files Size Format View
etd.pdf 1.863Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record