Pages that link to "Item:Q3591342"
From MaRDI portal
The following pages link to The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm (Q3591342):
Displayed 4 items.
- Upper bounds for binary identifying codes (Q1012154) (← links)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs (Q5859639) (← links)
