Yaping Mao

most citedSteiner 3-diameter, maximum degree and size of a graph

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

collaborators

3 papers

cs.DS2023

Streaming Algorithms for the $k$ -Submodular Cover Problem

Wenqi Wang, Gregory Gutin, Yaping Mao +2

Given a natural number $k \geq 2$ , we consider the $k$ -submodular cover problem ( $k$ -SC). The objective is to find a minimum cost subset of a ground set $X$ subject to the…

math.CO2023

Constructing disjoint Steiner trees in Sierpiński graphs

Chenxu Yang, Ping Li, Yaping Mao +2

Let $G$ be a graph and $S \subseteq V (G)$ with $∣ S ∣ \geq 2$ . Then the trees $T_{1}, T_{2}, \dots, T_{ℓ}$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$ -Stei…

math.CO2017★ 2 cited

Steiner 3-diameter, maximum degree and size of a graph

Yaping Mao

The Steiner $k$ -diameter $s d ia m_{k} (G)$ of a graph $G$ , introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical diameter. W…

Streaming Algorithms for the k-Submodular Cover Problem

Constructing disjoint Steiner trees in Sierpiński graphs

Steiner 3-diameter, maximum degree and size of a graph

Streaming Algorithms for the $k$ -Submodular Cover Problem