Exact (exponential) algorithms for the dominating set problem

FV Fomin, D Kratsch, GJ Woeginger - … , Bad Honnef, Germany, June 21-23 …, 2005 - Springer
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …
被引用次数：173 相关文章

[引用][C] Exact (Exponential) Algorithms for the Dominating Set Problem

FV Fomin, D Kratsch, GJ Woeginger - Graph-Theoretic Concepts in …, 2004 - cir.nii.ac.jp
Exact (Exponential) Algorithms for the Dominating Set Problem | CiNii Research CiNii 国立
情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす …

Exact (Exponential) Algorithms for the Dominating Set Problem

FV Fomin, D Kratsch, GJ Woeginger - Graph-Theoretic Concepts in Computer … - Springer
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …

Exact (exponential) algorithms for the dominating set problem

FV Fomin, D Kratsch… - … International Workshop on …, 2004 - research.utwente.nl
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …

[引用][C] Exact (exponential) algorithms for the dominating set problem

FV FOMIN, D KRATSCH… - Lecture notes in …, 2004 - pascal-francis.inist.fr
Exact (exponential) algorithms for the dominating set problem CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …

[引用][C] Exact (Exponential) algorithms for the dominating set problem

FV Fomin, D Kratsch, GJ Woeginger - … Notes in Computer Science (см. в …, 2004 - elibrary.ru

Exact (exponential) algorithms for the dominating set problem

FV Fomin, D Kratsch, GJ Woeginger - Graph-Theoretic Concepts in …, 2004 - research.tue.nl
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …
[PDF] utwente.nl

[PDF][PDF] Exact (Exponential) Algorithms for the Dominating Set Problem

FV Fomin, D Kratsch, GJ Woeginger - ris.utwente.nl
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …

Exact (exponential) algorithms for the dominating set problem

FV Fomin, D Kratsch, GJ Woeginger - Proceedings of the 30th …, 2004 - dl.acm.org
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …

Exact (Exponential) Algorithms for the Dominating Set Problem

FV Fomin, D Kratsch, GJ Woeginger - Graph-Theoretic Concepts in Computer … - infona.pl
We design fast exact algorithms for the problem of computing a minimum dominating set in
undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our …