Efficient minus and signed domination in graphs
From MaRDI portal
Publication:1399996
DOI10.1016/S0304-3975(02)00594-7zbMATH Open1022.68103OpenAlexW1997494006MaRDI QIDQ1399996FDOQ1399996
Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00594-7
chordal graphsplanar bipartite graphschordal bipartite graphschain interval graphsefficient minus dominationefficient signed domination
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Generalized domination and efficient domination in graphs
- Title not available (Why is that?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Title not available (Why is that?)
- Weighted efficient domination problem on some perfect graphs
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted domination of cocomparability graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- The algorithmic complexity of minus domination in graphs
- Title not available (Why is that?)
Cited In (7)
- The algorithmic complexity of minus domination in graphs
- Title not available (Why is that?)
- On complexities of minus domination
- Algorithms and Complexity of Signed, Minus, and Majority Domination
- Algorithms and Hardness for Signed Domination
- Dominating functions with integer values in graphs—a survey
- Upper minus total domination in small-degree regular graphs
Recommendations
This page was built for publication: Efficient minus and signed domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399996)
