Shenwei Huang

activity

20132026

most citedImproved Complexity Results on

k

-Coloring

P_{t}

-Free Graphs

23 citations · 59 across the 29 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

The saturation number of $K_{3, 3}$

Shenwei Huang, Hui Lei, Yongtang Shi +1

A graph $G$ is called $F$ -saturated if $G$ does not contain $F$ as a subgraph (not necessarily induced) but the addition of any missing edge to $G$ creates a copy of $F$ . The satur…

cs.CR2019★ 1 cited

A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems

Xueshuo Xie, Zhi Wang, Xuhang Xiao +3

Industrial Internet of Things (IIoT) is becoming an attack target of advanced persistent threat (APT). Currently, IIoT logs have not been effectively used for anomaly detection. In…

math.CO2019★ 5 cited

On graphs with no induced five-vertex path or paraglider

Shenwei Huang, T. Karthick

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ or $H_{2}$ . For a positive integer $t$ , $P_{t}$ is the chordless…

The saturation number of K3,3​

A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems

On graphs with no induced five-vertex path or paraglider

The saturation number of $K_{3, 3}$