[HTML][HTML] Polyhedra associated with identifying codes in graphs
GR Argiroffo, SM Bianchi, YP Lucarini… - Discrete Applied …, 2018 - Elsevier
The identifying code problem is a newly emerging search problem, challenging both from a
theoretical and a computational point of view, even for special graphs like bipartite graphs.
Hence, a typical line of attack for this problem is to determine minimum identifying codes of
special graphs or to provide bounds for their size. In this work we study the associated
polyhedra and present some general results on their combinatorial structure. We
demonstrate how the polyhedral approach can be applied to find minimum identifying codes …
theoretical and a computational point of view, even for special graphs like bipartite graphs.
Hence, a typical line of attack for this problem is to determine minimum identifying codes of
special graphs or to provide bounds for their size. In this work we study the associated
polyhedra and present some general results on their combinatorial structure. We
demonstrate how the polyhedral approach can be applied to find minimum identifying codes …
Polyhedra associated with identifying codes
GR Argiroffo, SM Bianchi, AK Wagler - Electronic Notes in Discrete …, 2013 - Elsevier
The identifying code problem is a newly emerging search problem, challenging both from a
theoretical and a computational point of view, even for special graphs like bipartite graphs.
Hence, a typical line of attack for this problem is to determine minimum identifying codes of
special graphs or to provide bounds for their size. In this work we study the associated
polyhedra and present some general results on their combinatorial structure. We
demonstrate how the polyhedral approach can be applied to find minimum identifying codes …
theoretical and a computational point of view, even for special graphs like bipartite graphs.
Hence, a typical line of attack for this problem is to determine minimum identifying codes of
special graphs or to provide bounds for their size. In this work we study the associated
polyhedra and present some general results on their combinatorial structure. We
demonstrate how the polyhedral approach can be applied to find minimum identifying codes …
Showing the best results for this search. See all results