scientific article; zbMATH DE number 6273738

zbMath1283.05203MaRDI QIDQ5403013

Mathieu Liedloff, Serge Gaspers

Publication date: 25 March 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1744/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

exponential time algorithmsminimum independent dominating setminimum maximal independent set

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Parameterized and exact algorithms for class domination coloring ⋮ A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks ⋮ On independent sets and bicliques in graphs ⋮ Parameterized and Exact Algorithms for Class Domination Coloring ⋮ Inclusion/exclusion meets measure and conquer

This page was built for publication: