Finding a Maximum Restricted t-Matching via Boolean Edge-CSP

From MaRDI portal

Finding a Maximum Restricted $t$-Matching via Boolean Edge-CSP

Jump to:navigation, search

MaRDI QIDQ6457409zbMATH OpenFDO

Authors Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa

Publication date 31 October 2023

This page was built for publication: Finding a Maximum Restricted $t$-Matching via Boolean Edge-CSP

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Finding_a_Maximum_Restricted_$t$-Matching_via_Boolean_Edge-CSP&oldid=95156807"