Pages that link to "Item:Q400524"

The following pages link to On the algorithmic complexity of \(k\)-tuple total domination (Q400524):

Displaying 12 items.

• Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
• Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
• Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs (Q1661898) (← links)
• Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929) (← links)
• Total 2-domination of proper interval graphs (Q2043384) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
• Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
• (Q5377028) (← links)
• An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
• k-Efficient domination: Algorithmic perspective (Q6115759) (← links)