Finding outer-connected dominating sets in interval graphs
DOI10.1016/J.IPL.2015.07.008zbMATH Open1337.05100OpenAlexW1444318869MaRDI QIDQ495667FDOQ495667
Authors: Chiou-Jiun Lin, Jia-Jie Liu, Yue-Li Wang 
Publication date: 15 September 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.008
Recommendations
- On the outer-connected domination in graphs
- On the number of outer connected dominating sets of graphs
- scientific article
- Algorithm and hardness results for outer-connected dominating set in graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Total domination in interval graphs revisited
- On the total outer-connected domination in graphs
- Total domination in interval graphs
- Total domination in interval graphs
- Outer-connected 2-dominating sets of graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Title not available (Why is that?)
- On the outer-connected domination in graphs
- The outer-connected domination number of a graph
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- Title not available (Why is that?)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Cited In (2)
This page was built for publication: Finding outer-connected dominating sets in interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495667)
