An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1080/09720529.2014.986906 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2440158214 / 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: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463350 / 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: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of \(m\)-trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ``Topics on Domination'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-neighbor domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominations in trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2793037 / 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: Fast algorithms for the dominating set problem on permutation graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:11, 28 July 2024

scientific article; zbMATH DE number 7509108
Language Label Description Also known as
English
An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs
scientific article; zbMATH DE number 7509108

    Statements

    An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2022
    0 references
    design of algorithms
    0 references
    analysis of algorithms
    0 references
    permutation graph
    0 references
    \(k\)-domination
    0 references
    caterpillar
    0 references

    Identifiers