An $$O^{*}(1.4366^n)$$ O ∗ ( 1 . 4366 n ) -time exact algorithm for maximum $$P_2$$ P 2 -packing in cubic graphs-Reference-Cited by-同舟云学术

An $$O^{*}(1.4366^n)$$ O ∗ ( 1 . 4366 n ) -time exact algorithm for maximum $$P_2$$ P 2 -packing in cubic graphs

Published:2015-04-28 Issue:2 Volume:32 Page:594-607
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chang Maw-Shang,Chen Li-Hsuan,Hung Ling-Ju

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-015-9884-8.pdf

Reference19 articles.

1. Bar-Yehuda R, Halldórsson MM, Naor J, Shachnai H, Shapira I (2006) Scheduling split intervals. SIAM J Comput 36:1–15

2. Bejar R, Krishnamachari B, Gomes C, Selman B (2001) Distributed constraint satisfaction in a wireless sensor tracking system. In: Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence

3. Björklund A, Husfeldt T, Kaski P, Koivisto M (2010) Narrow sieves for parameterized paths and packings, CoRR abs/1007.1161

4. Chang M-S, Chen L-H, Hung L-J (2014) A $$5k$$ 5 k kernel for $$P_2$$ P 2 -packing in net-free graphs. In: Proceedings of ICSEC 2014, pp. 12–17

5. Chen J, Feng Q, Liu Y, Lu S, Wang J (2011) Improved deterministic algorithms for weighted matching and packing problems. Theor Comput Sci 412:2503–2512

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On maximum $$P_3$$-packing in claw-free subcubic graphs;Journal of Combinatorial Optimization;2021-02-09