Dominating set games.
DOI10.1016/J.ORL.2004.02.004zbMATH Open1098.91017OpenAlexW2134225083MaRDI QIDQ703283FDOQ703283
Authors: Bas van Velzen 
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.004
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Games involving graphs (91A43) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ideal 0, 1 matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Relations between packing and covering numbers of a tree
- Balanced matrices
- On the Core of Cost Allocation Games Defined on Location Problems
- Graphs whose neighborhoods have no special cycles
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
Cited In (7)
- A note on balancedness of dominating set games
- Balancedness of edge covering games
- BALANCEDNESS OF INTEGER DOMINATION GAMES
- Approximate core allocations for edge cover games
- A game theoretic approach for minimal connected dominating set
- On the cores of games arising from integer edge covering functions of graphs
- The cores of paired-domination games
This page was built for publication: Dominating set games.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703283)
