The \textsc{red-blue separation} problem on graphs
From MaRDI portal
Publication:2169962
DOI10.1007/978-3-031-06678-8_21OpenAlexW4283816843MaRDI QIDQ2169962
Ralf Klasing, Florent Foucaud, Subhadeep Ranjan Dev, Tuomo Lehtilä, Sanjana Dey
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_21
Related Items (2)
Monochromatic partitioning of colored points by lines ⋮ The \textsc{Red-Blue Separation} problem on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Parameterizations of test cover with bounded test sizes
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- A simplified NP-complete satisfiability problem
- On separating systems
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- Approximation algorithms for the test cover problem
- Identification of points using disks
- On separating points by lines
- Extremal graphs for the identifying code problem
- Induced subsets
- SEPARATING POINTS BY AXIS-PARALLEL LINES
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- On a new class of codes for identifying vertices in graphs
- An induced subgraph characterization of domination perfect graphs
- Analytical approach to parallel repetition
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Discriminating Codes in Geometric Setups
This page was built for publication: The \textsc{red-blue separation} problem on graphs
