The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes

From MaRDI portal
Revision as of 10:48, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2659073

DOI10.1016/J.DAM.2020.12.018OpenAlexW3115625065MaRDI QIDQ2659073

Author name not available (Why is that?)

Publication date: 25 March 2021

Published in: (Search for Journal in Brave)

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



zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes

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

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:2659073&oldid=15483829"
Powered by MediaWiki