Red-blue unshared dominators

DOI10.1007/978-3-032-04700-7_8MaRDI QIDQ6852236zbMATH OpenFDO

Authors Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A threshold of ln n for approximating set cover
• Algorithmic meta-theorems for restrictions of treewidth
• An induced subgraph characterization of domination perfect graphs
• Approximation algorithms for the test cover problem
• Approximation hardness of dominating set problems in bounded degree graphs
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• Locating and total dominating sets in trees
• On a new class of codes for identifying vertices in graphs
• On separating systems
• On the parameterized complexity of red-blue points separation
• Parameterizations of test cover with bounded test sizes
• Parameterized Algorithms for Modular-Width
• Parameterized complexity for iterated type partitions and modular-width
• Parameterized complexity of (d, r)-domination via modular decomposition
• Parameterized complexity of domination problems using restricted modular partitions
• The \textsc{Red-Blue Separation} problem on graphs
• Transitiv orientierbare Graphen

This page was built for publication: Red-blue unshared dominators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852236)