The RED-BLUE SEPARATION problem on graphs

We introduce the Red-Blue Separation problem on graphs, where we are given a graph G=(V,E) whose vertices are colored either red or blue, and we want to select a (small) subset S⊆V, called red-blue separating set, such that for every red-blue pair of vertices, there is a vertex s∈S whose closed neig...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 970; s. 114061
Hlavní autori:	Dev, Subhadeep Ranjan, Dey, Sanjana, Foucaud, Florent, Klasing, Ralf, Lehtilä, Tuomo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 29.08.2023 Elsevier
Predmet:	Combinatorics Computer Science Data Structures and Algorithms Discrete Mathematics Dominating sets Identifying codes Mathematics Separating sets Separating sets Identifying codes Dominating sets identifying codes separating sets dominating sets
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!