scientific article; zbMATH DE number 867663

MaRDI QIDQ4873776zbMATH OpenFDO

Authors W. J. Selig, Peter Slater

Publication date 22 April 1996

zbMATH Keywords

dominating setlinear time algorithmNP-hard problemindependent vertex set

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 866672
• On minimum dominating sets with minimum intersection
• Two algorithms for determining a minimum independent dominating set
• A note on the complexity of minimum dominating set

Cited in

(14)

• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• scientific article; zbMATH DE number 842019 (Why is no real title available?)
• scientific article; zbMATH DE number 5131681 (Why is no real title available?)
• Bibliography on domination in graphs and some basic definitions of domination parameters
• The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
• Approximating the minimum independent dominating set in perturbed graphs
• Models for minimum cost dominating trees
• Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
• Unsolved algorithmic problems on trees
• Graphs such that all minimum dominating sets intersect all maximally independent sets
• scientific article; zbMATH DE number 3929037 (Why is no real title available?)
• scientific article; zbMATH DE number 4150229 (Why is no real title available?)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• Cohabitation of independent sets and dominating sets in trees

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 Q4873776)