厄尔曼的子图同构算法

Question

有人可以在MATLAB中给我一个有效的Ullman图同构问题实现，或链接到它。或者，如果你至少在C中，那么我会尝试在MATLAB中实现它。

由于

Answer 1

我也是这样看的。我一直在网上聊天但到目前为止没有运气，但我发现了这个： Algorithm，解释算法。

另一方面，我发现了这个：

def search(graph,subgraph,assignments,possible_assignments):
update_possible_assignments(graph,subgraph,possible_assignments)

i=len(assignments)

# Make sure that every edge between assigned vertices in the subgraph is also an
# edge in the graph.
for edge in subgraph.edges:
 if edge.first<i and edge.second<i:
  if not graph.has_edge(assignments[edge.first],assignments[edge.second]):
    return False

# If all the vertices in the subgraph are assigned, then we are done.
if i==subgraph.n_vertices:
 return True

 for j in possible_assignments[i]:
  if j not in assignments:
   assignments.append(j)

  # Create a new set of possible assignments, where graph node j is the only 
  # possibility for the assignment of subgraph node i.
  new_possible_assignments = deep_copy(possible_assignments)
  new_possible_assignments[i] = [j]

  if search(graph,subgraph,assignments,new_possible_assignments):
    return True

  assignments.pop()
  possible_assignments[i].remove(j)
  update_possible_assignments(graph,subgraph,possible_assignments)

  def find_isomporhism(graph,subgraph):
  assignments=[]
  possible_assignments = [[True]*graph.n_vertices for i in     range(subgraph.n_vertices)]
  if search(graph,subgraph,asignments,possible_assignments):
   return assignments
  return None

这里：implementation。我没有把它转换成Matlab的技能，如果你有它们，我真的很感激，如果你可以在你完成时分享你的代码。