Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.08.022 / rank
Normal rank
 
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.1016/j.dam.2018.08.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897850773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of distance paired-domination problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for paired-domination problem in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129097715 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.08.022 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:04, 11 December 2024

scientific article
Language Label Description Also known as
English
Computing a minimum paired-dominating set in strongly orderable graphs
scientific article

    Statements

    Computing a minimum paired-dominating set in strongly orderable graphs (English)
    0 references
    0 references
    18 December 2018
    0 references
    domination
    0 references
    paired-domination
    0 references
    strongly orderable graphs
    0 references
    polynomial time algorithm
    0 references

    Identifiers