Pages that link to "Item:Q2413180"

The following pages link to A linear-time algorithm for the identifying code problem on block graphs (Q2413180):

Displaying 3 items.

• Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
• Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
• Locating-Domination and Identification (Q3384611) (← links)