Study of identifying code polyhedra for some families of split graphs

DOI10.1007/978-3-319-09174-7_2MaRDI QIDQ3195310zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_2

zbMATH Keywords

identifying code problempolyhedral approachsplit graphs

Mathematics Subject Classification ID

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

Recommendations

• Progress on the description of identifying code polyhedra for some families of split graphs
• Polyhedra associated with identifying codes in graphs
• The complexity of the identifying code problem in restricted graph classes
• A linear-time algorithm for the identifying code problem on block graphs
• Identifying codes in line graphs

Cited in

(8)

• 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
• The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
• Linear-time algorithms for three domination-based separation problems in block graphs
• A linear-time algorithm for the identifying code problem on block graphs
• On three domination-based identification problems in block graphs
• On three domination-based identification problems in block graphs

This page was built for publication: Study of identifying code polyhedra for some families of split graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195310)