activity
20092022
most citedThe zero exemplar distance problem

13 citations · 36 across the 28 of their papers we have counts for

collaborators

28 papers

cs.NI2022

AI-aided Traffic Control Scheme for M2M Communications in the Internet of Vehicles

Haijun Zhang, Minghui Jiang, Xiangnan Liu +2

Due to the rapid growth of data transmissions in internet of vehicles (IoV), finding schemes that can effectively alleviate access congestion has become an important issue. Recentl…

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…

math.CO2021

Vertebrate interval graphs

Rain Jiang, Kai Jiang, Minghui Jiang

A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed , there is…

math.CO2021★ 1 cited

Partitioning an interval graph into subgraphs with small claws

Rain Jiang, Kai Jiang, Minghui Jiang

The claw number of a graph is the largest number such that is an induced subgraph of . Interval graphs with claw number at most are cluster graphs when $v…

math.CO2021

Caterpillars and alternating paths

Rain Jiang, Kai Jiang, Minghui Jiang

Let (respectively, ) be the maximum number such that any tree with edges can be transformed by contracting edges (respectively, by removing vertices) into a ca…