On the feedback vertex set problem in permutation graphs (Q1338778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Connected domination and Steiner set on weighted permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for maxdominance, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum independent dominating set in a permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination problems for permutation and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation graphs: Connected domination and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Comparability and Permutation Graphs / rank
 
Normal rank

Latest revision as of 10:27, 23 May 2024

scientific article
Language Label Description Also known as
English
On the feedback vertex set problem in permutation graphs
scientific article

    Statements

    Identifiers