Linear rankwidth meets stability

DOI10.1137/1.9781611975994.72OpenAlexW3002872960MaRDI QIDQ5146844

Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz, Jaroslav Nešetřil

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.07748

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Bounds on half graph orders in powers of sparse graphs ⋮ Regular partitions of gentle graphs ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes

This page was built for publication: Linear rankwidth meets stability