Dominating set counting in graph classes

Shuji Kijima, Yoshio Okamoto, Takeaki Uno

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Citations (Scopus)

Abstract

We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the time complexity. On the other hand, we prove that counting the number of dominating sets (and minimum dominating sets) in split graphs and chordal bipartite graphs is #P-complete. These results are in vivid contrast with the recent results on counting the independent sets and the matchings in chordal graphs and chordal bipartite graphs.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 17th Annual International Conference, COCOON 2011, Proceedings
Pages13-24
Number of pages12
DOIs
Publication statusPublished - 2011
Event17th Annual International Computing and Combinatorics Conference, COCOON 2011 - Dallas, TX, United States
Duration: Aug 14 2011 → Aug 16 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6842 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th Annual International Computing and Combinatorics Conference, COCOON 2011
CountryUnited States
CityDallas, TX
Period8/14/11 → 8/16/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Access to Document

Other files and links

Fingerprint Dive into the research topics of 'Dominating set counting in graph classes'. Together they form a unique fingerprint.

Cite this