On complexities of minus domination (Q1751171): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2016.04.002 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022416027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in small-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic complexity of minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minus Domination Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed and minus domination in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the minus (signed) total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on domination and minus domination numbers in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper minus domination in a claw-free cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference between the domination number and the minus domination number of a cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound on the minus-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient minus and signed domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of \(Y\)-dominating functions on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Lower Bounds of the Signed Domination Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on alliances and related parameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined search tree technique for dominating set on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of majority domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed and Minus Domination in Complete Multipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Split Decomposition Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient split decomposition via graph-labelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858149 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2016.04.002 / rank
 
Normal rank

Latest revision as of 08:15, 11 December 2024

scientific article
Language Label Description Also known as
English
On complexities of minus domination
scientific article

    Statements

    On complexities of minus domination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    domination
    0 references
    minus domination
    0 references
    fixed-parameter tractable
    0 references
    \(d\)-degenerate graph
    0 references
    chordal graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references