Pages that link to "Item:Q2664444"

The following pages link to Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444):

Displaying 3 items.

• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)