Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029336174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the outer-connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / 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: Q3481747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of maximum-clique transversal sets on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of signed and minus total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of \(Y\)-dominating functions on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly chordal graphs, steiner trees, and connected domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time recognition algorithm for proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank

Latest revision as of 15:13, 7 July 2024

scientific article
Language Label Description Also known as
English
Computing a minimum outer-connected dominating set for the class of chordal graphs
scientific article

    Statements

    Computing a minimum outer-connected dominating set for the class of chordal graphs (English)
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    graph algorithms
    0 references
    domination
    0 references
    outer-connected domination
    0 references
    proper interval graph
    0 references
    doubly chordal graph
    0 references
    undirected path graph
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references