On separating systems
From MaRDI portal
Publication:875044
DOI10.1016/J.EJC.2006.04.003zbMATH Open1113.05097OpenAlexW2080276120MaRDI QIDQ875044FDOQ875044
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
Cites Work
- Perfect Hashing and Probability
- On generalized graphs
- On a problem concerning separating systems of a finite set
- Minimal completely separating systems
- On separating systems of a finite set
- On separating systems whose elements are sets of at most k elements
- Minimal completely separating systems of \(k\)-sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (35)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension}
- Separating path systems of almost linear size
- New constructions of SSPDs and their applications
- Separating systems and oriented graphs of diameter two
- Geometric spanners for weighted point sets
- On the power of the semi-separated pair decomposition
- On the 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
- Region-fault tolerant geometric spanners
- Bounds and extremal graphs for total dominating identifying codes
- Separating systems of conjunctions.
- Search When the Lie Depends on the Target
- The \textsc{Red-Blue Separation} problem on graphs
- Progress towards the two-thirds conjecture on locating-total dominating sets
- On locating and neighbor-locating colorings of sparse graphs
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- On the path separation number of graphs
- Characterizing extremal graphs for open neighbourhood location-domination
- On the biclique cover of the complete graph
- Separation in homogeneous systems with independent identical elements
- The \textsc{red-blue separation} problem on graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- On/off scale separation
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
- Some new bounds for cover-free families through biclique covers
- Revisiting and Improving Upper Bounds for Identifying Codes
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
- On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
- On the Power of the Semi-Separated Pair Decomposition
- Covering complete hypergraphs with cuts of minimum total size
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Bipartite Hansel results for hypergraphs
- Separating Sessions Smoothly
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
This page was built for publication: On separating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875044)
