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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12190-020-01345-4 / 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.1007/s12190-020-01345-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3016425788 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S12190-020-01345-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:47, 16 December 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