Acyclic domination on bipartite permutation graphs (Q845701): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination problem on some perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs / rank
 
Normal rank

Latest revision as of 10:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Acyclic domination on bipartite permutation graphs
scientific article

    Statements

    Acyclic domination on bipartite permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    dominating set
    0 references
    acyclic dominating set
    0 references
    bipartite permutation graph
    0 references
    0 references