1 citations · 3 across the 10 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Partial order alignment by adjacencies and breakpoints
Rain Jiang, Kai Jiang, Minghui Jiang
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already…
cs.CC2021★ 1 cited
Decomposing a graph into subgraphs with small components
Rain Jiang, Kai Jiang, Minghui Jiang
The component size of a graph is the maximum number of edges in any connected component of the graph. Given a graph and two integers and , -Decomposition is the p…