The eternal dominating set problem for proper interval graphs (Q2345856): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027125546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protecting a graph with mobile guards / rank
 
Normal rank

Latest revision as of 03:25, 10 July 2024

scientific article
Language Label Description Also known as
English
The eternal dominating set problem for proper interval graphs
scientific article

    Statements

    The eternal dominating set problem for proper interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    eternal dominating set
    0 references
    proper interval graphs
    0 references
    0 references