A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability

MaRDI QIDQ7339257arXivFDO

Authors Radu Curticapean, Daniel Neuen, Tim Seppelt, Ben Young

Publication date 2026

Published in arXiv

arXiv classification

cs.LO

This page was built for publication: A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7339257)