Search Results - "Bui, Minh Binh"

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems by Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin

“…Given a graph G we provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Their runtime is…”
Get full text

How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection by Bui-Xuan, Binh-Minh, Jones, Nick S.

“…By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2n), with n being the number of…”
Get full text

Feedback vertex set on graphs of low clique-width by Bui-Xuan, Binh-Minh, Suchý, Ondřej, Telle, Jan Arne, Vatshelle, Martin

“…The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot…”
Get full text

The effect of adverse childhood experiences on depression, psychological distress and suicidal thought in Vietnamese adolescents: Findings from multiple cross-sectional studies by Thai, Truc Thanh, Cao, Phuong Le Tran, Kim, Loan Xuan, Tran, Doan Phuoc, Bui, Minh Binh, Bui, Han Hy Thi

“…•Adverse childhood experiences (ACEs) are common in Vietnamese adolescents.•The nature of ACEs and the overlap among them vary widely across population.•ACEs…”
Get full text

Boolean-width of graphs by Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin

“…We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods–Boolean sums of neighborhoods–across a cut of a…”
Get full text

Computing small temporal modules in time logarithmic in history length by Bui-Xuan, Binh-Minh, Hourcade, Hugo, Miachon, Cédric

“…A temporal graph G is a sequence of static graphs indexed by a set of integers representing time instants. Given Δ an integer, a Δ -module is a set of vertices…”
Get full text

H -join decomposable graphs and algorithms with runtime single exponential in rankwidth by Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin

“…We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call a H…”
Get full text

Tree-representation of set families and applications to combinatorial decompositions by Bui-Xuan, Binh-Minh, Habib, Michel, Rao, Michaël

“…The number of families over ground set V is 22|V| and by this fact it is not possible to represent such a family using a number of bits polynomial in |V|…”
Get full text

Competitive graph searches by Bui-Xuan, Binh-Minh, Habib, Michel, Paul, Christophe

“…We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then…”
Get full text

On Modular Decomposition Concepts: the case for Homogeneous Relations by Bui-Xuan, Binh-Minh, Habib, Michel, Limouzy, Vincent, de Montgolfier, Fabien

Get full text

How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection by Bui-Xuan, Binh-Minh, Jones, Nick S.

“…By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2n), with n being the number of…”
Get full text

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth: Third Workshop on Graph Classes, Optimization, and Width Parameters, Eugene, Oregon, USA, October 2007 by BUI-XUAN, Binh-Minh, TELLE, Jan Arne, VATSHELLE, Martin

Get full text

Feedback vertex set on graphs of low cliquewidth by Bui-Xuan, Binh-Minh, Suchy, Ondra, Telle, Jan Arne, Vatshelle, Martin

“…The Feedback Vertex Set problem asks whether a graph contains $q$ vertices meeting all its cycles. This is not a local property, in the sense that we cannot…”
Get full text

Distributed computation of temporal twins in periodic undirected time-varying graphs by Azerouk, Lina, Bui-Xuan, Binh-Minh, Palisoc, Camille, Potop-Butucaru, Maria, Tighilt, Massinissa

“…Twin nodes in a static network capture the idea of being substitutes for each other for maintaining paths of the same length anywhere in the network. In…”
Get full text

Unifying the representation of symmetric crossing families and weakly partitive families by Bui-Xuan, B.-M., Habib, M.

“…The family of non-trivial minimizers of a symmetric submodular function is symmetric crossing, namely it is closed under the complementation of any member and…”
Get full text

Lightweight FEC: Rectangular Codes with Minimum Feedback Information by Bui-Xuan, Binh-Minh, Meyer, Pierre, Roux, Antoine

“…We propose a hybrid protocol combining a rectangular error-correcting code - paired with an error-detecting code - and a backward error correction in order to…”
Get full text

Temporal Matching by Baste, Julien, Bui-Xuan, Binh-Minh, Roux, Antoine

“…A link stream is a sequence of pairs of the form $(t,\{u,v\})$, where $t\in\mathbb N$ represents a time instant and $u\neq v$. Given an integer $\gamma$, the…”
Get full text

Intersection graphs of almost subnormal subgroups in general skew linear groups by Hai, Bui Xuan, Bui-Xuan, Binh-Minh, Van Chua, Le, Bien, Mai Hoang

“…Let $D$ be a division ring, $n$ a positive integer, and GL$_n(D)$ the general linear group of degree $n$ over $D$. In this paper, we study the induced subgraph…”
Get full text

How modular structure can simplify tasks on networks by Bui-Xuan, Binh-Minh, Jones, Nick S

“…By considering the task of finding the shortest walk through a network we find an algorithm for which the run time is not as O(2^n), with n being the number of…”
Get full text

A Note on Graphs of Linear Rank-Width 1 by Bui-Xuan, Binh-Minh, Kanté, Mamadou Moustapha, Limouzy, Vincent

“…We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An…”
Get full text