Pages that link to "Item:Q2819508"
From MaRDI portal
The following pages link to Upper Domination: Complexity and Approximation (Q2819508):
Displaying 9 items.
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Weighted upper domination number (Q2413167) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM (Q6081707) (← links)
- Minimal zero forcing sets (Q6644905) (← links)