On separating systems
From MaRDI portal
Publication:875044
DOI10.1016/j.ejc.2006.04.003zbMath1113.05097OpenAlexW2080276120MaRDI QIDQ875044
Béla Bollobás, Alexander D. Scott
Publication date: 10 April 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.04.003
Related Items (28)
Revisiting and Improving Upper Bounds for Identifying Codes ⋮ On the path separation number of graphs ⋮ On the Power of the Semi-Separated Pair Decomposition ⋮ Separating systems and oriented graphs of diameter two ⋮ The \textsc{red-blue separation} problem on graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ On the biclique cover of the complete graph ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ New constructions of SSPDs and their applications ⋮ The \textsc{Red-Blue Separation} problem on graphs ⋮ Bipartite Hansel results for hypergraphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Geometric spanners for weighted point sets ⋮ On the power of the semi-separated pair decomposition ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension ⋮ On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ Search When the Lie Depends on the Target ⋮ Some new bounds for cover-free families through biclique covers ⋮ Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Region-fault tolerant geometric spanners ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5
Cites Work
- On separating systems whose elements are sets of at most k elements
- Perfect Hashing and Probability
- On generalized graphs
- On separating systems of a finite set
- Minimal completely separating systems
- On a problem concerning separating systems of a finite set
- Minimal completely separating systems of \(k\)-sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On separating systems
