Pages that link to "Item:Q2870024"
From MaRDI portal
The following pages link to The Complexity of the Identifying Code Problem in Restricted Graph Classes (Q2870024):
Displaying 7 items.
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- Some results about a conjecture on identifying codes in complete suns (Q6070992) (← links)