| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429137 | Information Processing Letters | 2009 | 5 Pages |
Abstract
In this paper we present unified methods to solve the minus and signed total domination problems for chordal bipartite graphs and trees in O(n2) and O(n+m) time, respectively. We also prove that the decision problem for the signed total domination problem on doubly chordal graphs is NP-complete. Note that bipartite permutation graphs, biconvex bipartite graphs, and convex bipartite graphs are subclasses of chordal bipartite graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
