Yun Wang

collaborators

5 papers

math.CO2024

Generalized paths and cycles in semicomplete multipartite digraphs

Jørgen Bang-Jensen, Yun Wang, Anders Yeo

It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D = (V, A)$ ,…

cs.LG2024

Tree-Regularized Tabular Embeddings

Xuan Li, Yun Wang, Bo Li

Tabular neural network (NN) has attracted remarkable attentions and its recent advances have gradually narrowed the performance gap with respect to tree-based models on many public…

math.CO2023

Strong arc decompositions of split digraphs

Joergen Bang-Jensen, Yun Wang

A {\bf strong arc decomposition} of a digraph $D = (V, A)$ is a partition of its arc set $A$ into two sets $A_{1}, A_{2}$ such that the digraph $D_{i} = (V, A_{i})$ is strong for $i = 1, 2$ . Bang-Je…

math.CO2023

Arc-disjoint out- and in-branchings in compositions of digraphs

Joergen Bang-Jensen, Yun Wang

An out-branching $B_{u}^{+}$ (in-branching $B_{u}^{-}$ ) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$ , called the root, has in-degr…

math.CO2023

Arc-disjoint out-branchings and in-branchings in semicomplete digraphs

Joergen Bang-Jensen, Yun Wang

An out-branching $B_{u}^{+}$ (in-branching $B_{u}^{-}$ ) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$ , called the root, has in-degr…