Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187): 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.disopt.2016.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2463730576 / 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: 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: The Complexity of the Identifying Code Problem in Restricted Graph Classes / 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: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the identifying code problem on block 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: On the width—length inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of the set covering polytope / 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: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank

Latest revision as of 16:07, 15 July 2024

scientific article
Language Label Description Also known as
English
Progress on the description of identifying code polyhedra for some families of split graphs
scientific article

    Statements

    Progress on the description of identifying code polyhedra for some families of split graphs (English)
    0 references
    24 May 2018
    0 references
    identifying code problem
    0 references
    polyhedral approach
    0 references
    split graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers