A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / author
 
Property / author: Li-ying Kang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012682579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination and Steiner set on weighted permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of trees with equal paired and double domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of Cartesian products of graphs and rainbow domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / 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: Total and paired-domination numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in claw-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large paired-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices contained in all or in no minimum paired-dominating set of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Efficient Algorithms for Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in inflated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for the domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient PRAM algorithm for maximum-weight independent set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the dominating set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination on bipartite permutation graphs / rank
 
Normal rank

Latest revision as of 03:36, 29 June 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for the paired-domination problem on permutation graphs
scientific article

    Statements

    A polynomial-time algorithm for the paired-domination problem on permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    algorithm
    0 references
    permutation graph
    0 references
    paired-domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references