Algorithmic aspects of Roman domination in graphs (Q2053064): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Roman domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Roman trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defending the Roman Empire from multiple attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defending the Roman Empire---a new strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets in tree convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for Roman domination on some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Revision as of 07:52, 27 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic aspects of Roman domination in graphs
scientific article

    Statements

    Algorithmic aspects of Roman domination in graphs (English)
    0 references
    29 November 2021
    0 references
    Roman domination
    0 references
    tree convex bipartite graph
    0 references
    NP-completeness
    0 references
    APX-complete
    0 references

    Identifiers