scientific article; zbMATH DE number 975414

MaRDI QIDQ5284091zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi, David P. Jacobs

Publication date 4 February 1997

zbMATH Keywords

dominating setlinear algorithmNP-completenessprivate domination numbertree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Private matchings and allocations
• Private matchings and allocations
• Arrovian theorems with private alternatives domains and selfish individuals
• scientific article; zbMATH DE number 1689581
• Private domination number of a graph
• Optimal allocation mechanisms with single-dimensional private information
• scientific article; zbMATH DE number 5138367
• Private approximation of search problems
• Private Approximation of Search Problems
• Privacy stochastic games in distributed constraint reasoning

Cited in

(9)

• Using maximality and minimality conditions to construct inequality chains
• An algorithm for prescribed multiple domination in arbitrary graphs
• Irredundance perfect graphs
• scientific article; zbMATH DE number 5138367 (Why is no real title available?)
• Private domination number of a graph
• The Private Neighbor Cube
• Maximum nontrivial convex cover number of join and corona of graphs
• On maximizing private neighbors in graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters

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