Stéphan Thomassé

collaborators

2 papers

cs.DS2026

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Romain Bourneuf, Nathan Claudet, Sang Yoon Kim +3

We introduce a new notion of distance between two graph states $∣ G ⟩$ and $∣ G^{'} ⟩$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a gr…

cs.DM2025

Bounded twin-width graphs are polynomially $I ¨ $ -bounded

We show that every graph with twin-width $t$ has chromatic number $O (I ¨ ^{k_{t}})$ for some integer $k_{t}$ , where $I ¨ $ denotes the clique number. This extends a quasi-polynomial bound…

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Bounded twin-width graphs are polynomially I¨-bounded

Bounded twin-width graphs are polynomially $I ¨ $ -bounded