Pages that link to "Item:Q5459139"

The following pages link to Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs (Q5459139):

Displaying 7 items.

• Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
• Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (Q2880919) (← links)
• An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
• (Q3703920) (← links)
• An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)