Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n-Reference-Cited by-同舟云学术

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n

Published:2013-05-31 Issue:2 Volume:70 Page:195-207
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Cygan Marek,Pilipczuk Marcin,Pilipczuk Michał,Wojtaszczyk Jakub Onufry

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/article/10.1007/s00453-013-9796-x/fulltext.html

Reference22 articles.

1. Björklund, A.: Determinant sums for undirected Hamiltonicity. In: FOCS, pp. 173–182. IEEE Comput. Soc., Los Alamitos (2010)

2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 67–74. ACM, New York (2007)

3. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)

4. Bodlaender, H.L., Thomassé, S., Yeo, A.: Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels. Technical report UU-CS-2008-030, Institute of Information and Computing Sciences, Utrecht University, Netherlands (2008)

5. Lecture Notes in Computer Science;C. Calabro,2009

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

1. Enumeration of Minimal Tropical Connected Sets;Lecture Notes in Computer Science;2023

2. Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$;Algorithmica;2022-09-14

3. Disjoint paths and connected subgraphs for H-free graphs;Theoretical Computer Science;2022-01

4. Disjoint Paths and Connected Subgraphs for H-Free Graphs;Lecture Notes in Computer Science;2021

5. Path Contraction Faster than $2^n$;SIAM Journal on Discrete Mathematics;2020-01