| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871360 | Discrete Applied Mathematics | 2018 | 10 Pages |
Abstract
A connected graph is distance-hereditary if any two vertices have the same distance in all of its connected induced subgraphs. This paper proposes a unified method for designing linear-time algorithms for counting independent sets and their two variants, independent dominating sets and independent perfect dominating sets, in distance-hereditary graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Min-Sheng Lin,