Peng Zhang

activity

20122020

collaborators

3 papers

cs.DS2020

Approximating the Weighted Minimum Label $s$ - $t$ Cut Problem

Peng Zhang

In the weighted (minimum) {\sf Label $s$ - $t$ Cut} problem, we are given a (directed or undirected) graph $G = (V, E)$ , a label set $L = {ℓ_{1}, ℓ_{2}, \dots, ℓ_{q}}$ with positi…

cs.DS2013

Algorithms for Cut Problems on Trees

Iyad Kanj, Guohui Lin, Tian Liu +7

We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that ru…

cs.DS2012

Algorithmic Aspects of Homophyly of Networks

Angsheng Li, Peng Zhang

We investigate the algorithmic problems of the {\it homophyly phenomenon} in networks. Given an undirected graph $G = (V, E)$ and a vertex coloring $c \colon V \rightarrow {1, 2, .…

Approximating the Weighted Minimum Label s-t Cut Problem

Algorithms for Cut Problems on Trees

Algorithmic Aspects of Homophyly of Networks

Approximating the Weighted Minimum Label $s$ - $t$ Cut Problem