Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Improved Parameterized Complexity of Happy Set Problems
Yosuke Mizutani, Blair D. Sullivan
We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Maximum Edge Happy Set (MaxEHS)--also known as Densest k-Subgraph. Given a gra…
cs.DS2022
Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality
Shweta Jain, Yosuke Mizutani, Blair Sullivan
Mining groups of genes that consistently co-express is an important problem in biomedical research, where it is critical for applications such as drug-repositioning and designing n…