Pages that link to "Item:Q753848"

The following pages link to On the computational complexity of upper fractional domination (Q753848):

Displaying 27 items.

• Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The b-chromatic number of a graph (Q1283791) (← links)
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
• The determinant of a tree's neighborhood matrix (Q1355240) (← links)
• On the computational complexity of upper total domination (Q1421481) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Maximal irredundant functions (Q1923617) (← links)
• Algorithmic aspects of upper edge domination (Q2034795) (← links)
• (In)approximability of maximum minimal FVS (Q2051849) (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
• Weighted upper domination number (Q2413167) (← links)
• A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
• On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
• A Boundary Property for Upper Domination (Q2819507) (← links)
• Upper Domination: Complexity and Approximation (Q2819508) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• The Private Neighbor Concept (Q3384113) (← links)
• Fractional Dominating Parameters (Q3384613) (← links)
• CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY (Q4288047) (← links)
• A maximum dicut in a digraph induced by a minimal dominating set (Q5090164) (← links)
• Linear programming approach for various domination parameters (Q5859511) (← links)
• Complexity of the max cut problem with the minimal domination constraint (Q5878608) (← links)
• Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
• Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
• In)approximability of Maximum Minimal FVS (Q6065391) (← links)
• THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM (Q6081707) (← links)