Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516): 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.dam.2022.06.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283773152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polyhedron of circulant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra associated with identifying codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of Identifying Code Polyhedra for Some Families of Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to locating-dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on the description of identifying code polyhedra for some families of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Identifying Code Problem in Restricted Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and total dominating sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and Locating–Dominating Codes in (Random) Geometric Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets and lifting procedures for the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
scientific article

    Statements

    Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    locating-dominating set problem
    0 references
    open locating-dominating set problem
    0 references
    locating total-dominating set problem
    0 references
    polyhedral approach
    0 references

    Identifiers