activity
20142021
most citedParameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2018 · cs.DSShow all

1 paper · 2 filters

cs.DS2018

Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition

L. Sunil Chandran, Yun Kuen Cheung, Davis Issac

We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing}…