The \textsc{Red-Blue Separation} problem on graphs (Q6168089): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4383197825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5224479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Codes in Hereditary Classes of Graphs and VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINTS BY AXIS-PARALLEL LINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizations of test cover with bounded test sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \textsc{red-blue separation} problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for the identifying code problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting and Improving Upper Bounds for Identifying Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of points using disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating points by lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and total dominating sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An induced subgraph characterization of domination perfect graphs / rank
 
Normal rank

Latest revision as of 13:29, 2 August 2024

scientific article; zbMATH DE number 7723917
Language Label Description Also known as
English
The \textsc{Red-Blue Separation} problem on graphs
scientific article; zbMATH DE number 7723917

    Statements

    The \textsc{Red-Blue Separation} problem on graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 August 2023
    0 references
    separating sets
    0 references
    dominating sets
    0 references
    identifying codes
    0 references

    Identifiers