Tractable connected domination for restricted bipartite graphs

Tian Liu (), Zhao Lu and Ke Xu ()
Additional contact information
Tian Liu: Peking University
Zhao Lu: Peking University
Ke Xu: Beihang University

Journal of Combinatorial Optimization, 2015, vol. 29, issue 1, No 16, 247-256

Abstract: Abstract Connected domination, i.e. the problem of finding a minimum connected dominating set in a graph, was known to be $$\mathcal {NP}$$ NP -complete for chordal bipartite graphs, but to be tractable for convex bipartite graphs. In this paper, connected domination is shown to be tractable for circular- and triad-convex bipartite graphs respectively, by efficient reductions from these graphs to convex bipartite graphs.

Keywords: Connected domination; Polynomial-time; Circular-convex bipartite graph; Triad-convex bipartite graph; Convex bipartite graph (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9729-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-014-9729-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9729-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().