Polyhedra associated with identifying codes in graphs (Q1752479): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gabriela R. Argiroffo / rank
Normal rank
 
Property / author
 
Property / author: Silvia M. Bianchi / rank
Normal rank
 
Property / author
 
Property / author: Annegret K. Wagler / rank
Normal rank
 
Property / author
 
Property / author: Gabriela R. Argiroffo / rank
 
Normal rank
Property / author
 
Property / author: Silvia M. Bianchi / rank
 
Normal rank
Property / author
 
Property / author: Annegret K. Wagler / 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.2017.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2735965034 / 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: Study of Identifying Code Polyhedra for Some Families of Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal identifying codes in trees and planar graphs with large girth / 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: Combinatorial Optimization / 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: Identifying Codes in Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329059 / 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: On a new class of codes for identifying vertices in graphs / 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: On the facial structure of the set covering polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Polyhedra associated with identifying codes in graphs
scientific article

    Statements

    Polyhedra associated with identifying codes in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    identifying code polyhedron
    0 references
    identifying code clutter
    0 references
    odd hypercycles
    0 references

    Identifiers