2 papers
cs.DC2026
A Configurable Heuristic for the MLCS Problem
Farhana Akter Tumpa, Rebin Silva Valan Arasu, Rajiv Gupta
Motivation: The Multiple Longest Common Subsequence (MLCS) problem for an arbitrary number of sequences is an NP-hard problem in sequence analysis. Existing exact algorithms based…
cs.PF2026
Solving Subgraph Extraction Problems Using Search
Rebin Silva Valan Arasu, Rajiv Gupta
Many NP-hard graph problems can be modeled as optimal subgraph extraction problems with feasibility constraints. From Network Design to Facility Location, from Robotics to Graph Dr…