Extensions of the Minimum Dominating Set Problem

DOI10.1080/02522667.1983.10698769zbMATH Open0521.05038OpenAlexW2077300841MaRDI QIDQ3671200FDOQ3671200

Authors: Nancy V. Phillips 

Publication date: 1983

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1983.10698769

zbMATH Keywords

dominating setspanning treestar packingminimum dominating set probleminteger programming set covering problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A Greedy Heuristic for the Set-Covering Problem
• A linear algorithm for the domination number of a tree
• Balanced matrices
• Algorithms for generalized stability numbers of tree graphs

This page was built for publication: Extensions of the Minimum Dominating Set Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671200)