Maximum matching in almost linear time on graphs of bounded clique-width

DOI10.1007/S00453-022-00999-9OpenAlexW4283780304WikidataQ114229326 ScholiaQ114229326MaRDI QIDQ2093582

Author name not available (Why is that?)

Publication date: 27 October 2022

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00999-9

Mathematics Subject Classification ID

No records found.

This page was built for publication: Maximum matching in almost linear time on graphs of bounded clique-width

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