for Research and Development in Informatics , Bucharest , Romania 1 Guillaume Ducoffe ICI - National Institute for Research and Development in Informatics, Bucharest, Romania The Research Institute of
We make progress on the fine-grained complexity of Maximum-Cardinality Matching on graphs of bounded clique-width. Quasi linear-time algorithms for this problem have been recently proposed for the important subclasses of bounded-treewidth graphs (Fomin et al., SODA'17) and graphs of bounded modular-width (Coudert et al., SODA'18). We present such algorithm for bounded split-width...
Institute of the University of Bucharest , Bucures?ti , Roma?nia 1 Universite? Co?te d'Azur , Inria , France 2 Dorian Mazauric 3 Universite? Co?te d'Azur , CNRS, Inria, I3S , France 4 Guillaume Ducoffe 5
, Kent State University , Kent , USA 2 Aix-Marseille Universite?, CNRS , Universite? de Toulon, LIS, Marseille , France 3 Guillaume Ducoffe National Institute for Research and Development in Informatics