scientific article; zbMATH DE number 2080250

MaRDI QIDQ4472497zbMATH OpenFDO

Authors Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690241.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Efficient minus and signed domination in graphs
• Total dominating functions on subclasses of chordal graphs
• On the complexity of signed and minus total domination in graphs
• The algorithmic complexity of minus domination in graphs
• On complexities of minus domination

Cited in

(7)

• Algorithms and complexity of signed, minus, and majority domination
• Efficient minus and signed domination in graphs
• The algorithmic complexity of minus domination in graphs
• On the complexity of signed and minus total domination in graphs
• Algorithms and Hardness for Signed Domination
• Minimal signed dominating functions of graphs
• Signed and minus total domination on subclasses of bipartite graphs.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472497)