Efficient Enumeration Algorithm for Dominating Sets in Bounded Degenerate Graphs

HANDLE Web Site オープンアクセス

書誌事項

タイトル別名
  • Efficient Enumeration Algorithm for Dominating Sets in Bounded Degenerate Graphs (Foundations and Applications of Algorithms and Computation)

この論文をさがす

抄録

Dominating sets are fundamental graph structures. However, enumeration of dominating sets has not received much attention. This study aims to propose an efficient enumeration algorithms for bounded degenerate graphs. The algorithm enumerates all the dominating sets for k-degenerate graphs in O(k) time per solution using O(n+m) space. Since planar graphs have a constant degeneracy, this algorithm can enumerate all such sets for planar graphs in constant time per solution.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ