Zobrazeno 1 - 10
of 178
pro vyhledávání: '"Le Van Bang"'
Autor:
Nguyen Van Thang, Le Van Bang
Publikováno v:
IEEE Access, Vol 11, Pp 57494-57502 (2023)
Recently, neural video compression networks have obtained impressive results. However, previous neural video compression models mostly focus on low-delay configuration with the order of display being the same as the order of coding. In this paper, we
Externí odkaz:
https://doaj.org/article/a2f0abf8e77e46128893ecf84ed70a08
We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be strongly conflic
Externí odkaz:
http://arxiv.org/abs/2408.05865
Autor:
Kratsch, Stefan, Le, Van Bang
A stable cutset in a graph $G$ is a set $S\subseteq V(G)$ such that vertices of $S$ are pairwise non-adjacent and such that $G-S$ is disconnected, i.e., it is both stable (or independent) set and a cutset (or separator). Unlike general cutsets, it is
Externí odkaz:
http://arxiv.org/abs/2407.02086
Autor:
Le, Hoang-Oanh, Le, Van Bang
The well-known Cluster Vertex Deletion problem (CVD) asks for a given graph $G$ and an integer $k$ whether it is possible to delete a set $S$ of at most $k$ vertices of $G$ such that the resulting graph $G-S$ is a cluster graph (a disjoint union of c
Externí odkaz:
http://arxiv.org/abs/2402.04931
A matching cut in a graph G is an edge cut of G that is also a matching. This short survey gives an overview of old and new results and open problems for Maximum Matching Cut, which is to determine the size of a largest matching cut in a graph. We al
Externí odkaz:
http://arxiv.org/abs/2312.12960
Autor:
Le, Van Bang, Rosenke, Christian
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the distance between x and y in T is at most k. Such a tree T is called a k-l
Externí odkaz:
http://arxiv.org/abs/2308.10756
Autor:
Le, Hoang-Oanh, Le, Van Bang
In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. Matching Cut (MC), respectively, Perfect Matching Cut (PMC), is the problem of deciding whether a given graph has a matching cut, respectively, a perfect matching cut.
Externí odkaz:
http://arxiv.org/abs/2307.05402
Let $d$-claw (or $d$-star) stand for $K_{1,d}$, the complete bipartite graph with 1 and $d\ge 1$ vertices on each part. The $d$-claw vertex deletion problem, $d$-CLAW-VD, asks for a given graph $G$ and an integer $k$ if one can delete at most $k$ ver
Externí odkaz:
http://arxiv.org/abs/2203.06766
Autor:
Le, Van Bang, Telle, Jan Arne
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and show that
Externí odkaz:
http://arxiv.org/abs/2107.06399
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a solution-lifting alg
Externí odkaz:
http://arxiv.org/abs/2101.03800