scientific article; zbMATH DE number 867663

zbMath0841.05050MaRDI QIDQ4873776

W. J. Selig, Peter J. Slater

Publication date: 22 April 1996

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

zbMATH Keywords

dominating setlinear time algorithmNP-hard problemindependent vertex set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: