✦ LIBER ✦

Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem

✍ Scribed by Ken-ichi Kawarabayashi; Yusuke Kobayashi

Book ID: 116630515
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 233 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 2452 || Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

✍ Guigó, Roderic; Gusfield, Dan 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 731 KB

We are pleased to present the proceedings of the Second Workshop on Al- rithms in Bioinformatics (WABI 2002), which took place on September 17-21, 2002 in Rome, Italy. The WABI workshop was part of a three-conference me- ing, which, in addition to WABI, included the ESA and APPROX 2002. The three co

Optimization of Pearl‘s method of condit

Optimization of Pearl‘s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem : A. Becker and D. Geiger

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Forthcoming Papers ## A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of c