Study of Identifying Code Polyhedra for Some Families of Split Graphs

DOI10.1007/978-3-319-09174-7_2zbMath1452.90325MaRDI QIDQ3195310

Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

split graphspolyhedral approachidentifying code problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations ⋮ A linear-time algorithm for the identifying code problem on block graphs ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ On three domination-based identification problems in block graphs ⋮ Progress on the description of identifying code polyhedra for some families of split graphs ⋮ Polyhedra associated with identifying codes in graphs ⋮ Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs

This page was built for publication: Study of Identifying Code Polyhedra for Some Families of Split Graphs