On separating systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 736306 (Why is no real title available?)
- scientific article; zbMATH DE number 874214 (Why is no real title available?)
- scientific article; zbMATH DE number 3238444 (Why is no real title available?)
- scientific article; zbMATH DE number 3261634 (Why is no real title available?)
- Minimal completely separating systems
- Minimal completely separating systems of \(k\)-sets
- On a problem concerning separating systems of a finite set
- On generalized graphs
- On separating systems of a finite set
- On separating systems whose elements are sets of at most k elements
- Perfect Hashing and Probability
Cited in
(33)- Some new bounds for cover-free families through biclique covers
- On/off scale separation
- Characterizing extremal graphs for open neighbourhood location-domination
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
- Search when the lie depends on the target
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- On locating and neighbor-locating colorings of sparse graphs
- The \textsc{Red-Blue Separation} problem on graphs
- Progress towards the two-thirds conjecture on locating-total dominating sets
- On the Power of the Semi-Separated Pair Decomposition
- New constructions of SSPDs and their applications
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
- Bipartite Hansel results for hypergraphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Region-fault tolerant geometric spanners
- Separating path systems of almost linear size
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Separating systems of conjunctions.
- On the biclique cover of the complete graph
- Separating systems and oriented graphs of diameter two
- On covering numbers, Young diagrams, and the local dimension of posets
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- On the power of the semi-separated pair decomposition
- Covering complete hypergraphs with cuts of minimum total size
- Separation in homogeneous systems with independent identical elements
- On the path separation number of graphs
- Bounds and extremal graphs for total dominating identifying codes
- Geometric spanners for weighted point sets
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
- Revisiting and improving upper bounds for identifying codes
- The \textsc{red-blue separation} problem on graphs
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)
