The algorithmic complexity of mixed domination in graphs (Q533883): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2011.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021417413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total matchings and total coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total matching numbers and total covering numbers of complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / 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: A recognition algorithm for the total graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of twelve covering and independence parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum domination in weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and location in acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 01:24, 4 July 2024

scientific article
Language Label Description Also known as
English
The algorithmic complexity of mixed domination in graphs
scientific article

    Statements

    The algorithmic complexity of mixed domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed domination
    0 references
    tree
    0 references
    split graph
    0 references
    algorithm
    0 references
    NP-complete
    0 references
    0 references