Buahong, S., Suppakitpaisarn, V., & Sripratak, P. (2025). Finding a b-matching that embeds the maximum number of edge pairs in a given set. Journal of Combinatorial Optimization, 49(5). https://doi.org/10.1007/s10878-025-01305-3
ISO-690 (author-date, English)BUAHONG, Siraphob, SUPPAKITPAISARN, Vorapong und SRIPRATAK, Piyashat, 2025. Finding a b-matching that embeds the maximum number of edge pairs in a given set. Journal of Combinatorial Optimization. 1 Juli 2025. Vol. 49, no. 5, . DOI 10.1007/s10878-025-01305-3.
Modern Language Association 9th editionBuahong, S., V. Suppakitpaisarn, und P. Sripratak. „Finding a B-Matching That Embeds the Maximum Number of Edge Pairs in a Given Set“. Journal of Combinatorial Optimization, Bd. 49, Nr. 5, Juli 2025, https://doi.org/10.1007/s10878-025-01305-3.
Mohr Siebeck - Recht (Deutsch - Österreich)Buahong, Siraphob/Suppakitpaisarn, Vorapong/Sripratak, Piyashat: Finding a b-matching that embeds the maximum number of edge pairs in a given set, Journal of Combinatorial Optimization 2025,
Emerald - HarvardBuahong, S., Suppakitpaisarn, V. und Sripratak, P. (2025), „Finding a b-matching that embeds the maximum number of edge pairs in a given set“, Journal of Combinatorial Optimization, Vol. 49 No. 5, verfügbar unter:https://doi.org/10.1007/s10878-025-01305-3.