Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The maximum common subgraph problem is to find the#R##N#largest subgraph common to two given graphs. This problem can be#R##N#solved either by constraint-based search, or by reduction to the maximum#R##N#clique problem.  evaluate these two models using modern algorithms,#R##N#and see that the best choice depends mainly upon whether the graphs#R##N#have labelled edges.  also study a variant of this problem where the#R##N#subgraph is required to be connected.  introduce a filtering algorithm#R##N#for this property and show that it may be combined with a restricted#R##N#branching technique for the constraint-based approach.  show how to#R##N#implement a similar branching technique in clique-inspired algorithms.#R##N#Finally,  experimentally compare approaches for the connected version,#R##N#and see again that the best choice depends on whether graphs have labels
['Ciaran McCreesh', 'Samba Ndojh Ndiaye', 'Patrick Prosser', 'Christine Solnon']
I am writing a research paper on a idea Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
[{"from": "human", "value": "I am writing a research paper on a idea Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The maximum common subgraph problem is to find the#R##N#largest subgraph common to two given graphs. This problem can be#R##N#solved either by constraint-based search, or by reduction to the maximum#R##N#clique problem.  evaluate these two models using modern algorithms,#R##N#and see that the best choice depends mainly upon whether the graphs#R##N#have labelled edges.  also study a variant of this problem where the#R##N#subgraph is required to be connected.  introduce a filtering algorithm#R##N#for this property and show that it may be combined with a restricted#R##N#branching technique for the constraint-based approach.  show how to#R##N#implement a similar branching technique in clique-inspired algorithms.#R##N#Finally,  experimentally compare approaches for the connected version,#R##N#and see again that the best choice depends on whether graphs have labels"}]