Maximum common subgraph of two vertex-labeled graphs?

I am doing a research project and I need to find the maximum common subgraph of two vertex-labeled graphs, does Matlab have functions to do this?

Answer 1

[Prateek Khandelwal]

There might not be any direct function in MATLAB to solve your problem.

There are however basic graph data structures available here which you can use to build your solution/algorithm, also, you can refer to MatlabBGL and gaimc for already existing graph algorithms to build upon.