An $$O^{*}(1.4366^n)$$ O ∗ ( 1 . 4366 n ) -time exact algorithm for maximum $$P_2$$ P 2 -packing in cubic graphs
Crossref DOI link: https://doi.org/10.1007/s10878-015-9884-8
Published Online: 2015-04-28
Published Print: 2016-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chang, Maw-Shang
Chen, Li-Hsuan
Hung, Ling-Ju
Text and Data Mining valid from 2015-04-28