Polyhedra associated with identifying codes in graphs
type: Item
instance of: scholarly article
title: Polyhedra associated with identifying codes in graphs
zbMATH Open document ID: 1433.90198
author: Yanina P. Lucarini
author: Gabriela R. Argiroffo
author: Silvia M. Bianchi
author: Annegret K. Wagler
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6872406
zbMATH Keywords: identifying code polyhedron
zbMATH Keywords: identifying code clutter
zbMATH Keywords: odd hypercycles
MaRDI profile type: Publication
full work available at URL: j.dam.2017.06.005
OpenAlex ID: W2735965034
cites work: On the set covering polyhedron of circulant matrices
cites work: Study of Identifying Code Polyhedra for Some Families of Split Graphs
cites work: Minimal identifying codes in trees and planar graphs with large girth
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
cites work: Combinatorial optimization. Packing and covering
cites work: The Complexity of the Identifying Code Problem in Restricted Graph Classes
cites work: Identifying Codes in Line Graphs
cites work: Q5620998
cites work: Q4329059
cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code
cites work: On a new class of codes for identifying vertices in graphs
cites work: Facets and lifting procedures for the set covering polytope
cites work: On the facial structure of the set covering polytope
DOI: 10.1016/J.DAM.2017.06.005
description: scientific article; zbMATH DE number 6872406