Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

Thread Subject:
Subgraph Isomorphisms for partial matching

Subject: Subgraph Isomorphisms for partial matching

From: Preet Desai

Date: 12 Apr, 2009 05:09:01

Message: 1 of 1

Hi all,
I have two planar graphs. Both the graphs represent the same data but one is a more complete data set whereas the other one is more sparse/incomplete.

I want to find all the possible matches the between the two graphs.
I thought one way I could accomplish this was by using subgraph isomorphism. I was hoping someone had suggestions for this application. I've seen the Boolean isomorphism function for whole graphs but don't really know what would be the best way to go about doing partial matching.

Tags for this Thread

No tags are associated with this thread.

What are tags?

A tag is like a keyword or category label associated with each thread. Tags make it easier for you to find threads of interest.

Anyone can tag a thread. Tags are public and visible to everyone.

Contact us