Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth-Reference-Cited by-同舟云学术

Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth

Published:2013 Issue: Volume: Page:196-207
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Bodlaender Hans L.,Cygan Marek,Kratsch Stefan,Nederlof Jesper

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39206-1_17

Reference24 articles.

1. Aigner, M., Ziegler, G.: Proofs from the book, Berlin, Germany (2010)

2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

3. Björklund, A.: Determinant sums for undirected Hamiltonicity. In: FOCS, pp. 173–182 (2010)

4. Björklund, A., Husfeldt, T., Taslaman, N.: Shortest cycle through specified elements. In: Rabani, Y. (ed.) SODA, pp. 1747–1753. SIAM (2012)

5. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR, abs/1211.1505 (2012)

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

1. The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Travelling on Graphs with Small Highway Dimension;Graph-Theoretic Concepts in Computer Science;2019

3. Deterministic Truncation of Linear Matroids;ACM Transactions on Algorithms;2018-06-04

4. Deterministic Truncation of Linear Matroids;ACM T ALGORITHMS;2018

5. Hitting forbidden subgraphs in graphs of bounded treewidth;Information and Computation;2017-10