Parameterized Algorithms and Hardness Results for Some Graph Motif Problems-Reference-Cited by-同舟云学术

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Published: Issue: Volume: Page:31-43
ISSN:
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Betzler Nadja,Fellows Michael R.,Komusiewicz Christian,Niedermeier Rolf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69068-9_6.pdf

Reference19 articles.

1. Alm, E., Arkin, A.P.: Biological networks. Curr. Opin. Struc. Biol. 13(2), 193–202 (2003)

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

3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proc. 39th STOC, pp. 67–74. ACM, New York (2007)

4. Cesati, M.: Perfect code is W[1]-complete. Inform. Process. Lett. 81, 163–168 (2002)

5. Deshpande, P., Barzilay, R., Karger, D.R.: Randomized decoding for selection-and-ordering problems. In: Proc. NAACL HLT 2007. Association for Computational Linguistics, pp. 444–451 (2007)

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

1. Colourful components in k-caterpillars and planar graphs;Theoretical Computer Science;2021-12

2. Detecting list-colored graph motifs in biological networks using branch-and-bound strategy;Computers in Biology and Medicine;2019-04

3. Business Network Analytics: From Graphs to Supernetworks;Business and Consumer Analytics: New Ideas;2019

4. Improved Parameterized Algorithms for Network Query Problems;Algorithmica;2018-12-18

5. A System For Motif Search In Biological Networks;Proceedings of the XIV Brazilian Symposium on Information Systems - SBSI'18;2018