Safe sets and in-dominating sets in digraphs
From MaRDI portal
Publication:6153473
DOI10.1016/j.dam.2023.12.012OpenAlexW4390376374MaRDI QIDQ6153473
Anders Yeo, Yan Dong Bai, Shinya Fujita, Hirotaka Ono, Jörgen Bang-Jensen
Publication date: 14 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.012
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Safe set problem on graphs
- Complementary cycles of all lengths in tournaments
- Finding a dominating set on bipartite graphs
- Safe sets in graphs: graph classes and structural parameters
- Safe number and integrity of graphs
- On pancyclic digraphs
- Approximating connected safe sets in weighted trees
- A compact mixed integer linear formulation for safe set problems
- On the weighted safe set problem on paths and cycles
- Digraph width measures in parameterized algorithmics
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
- Gallai colorings and domination in multipartite digraphs
- Reducibility among Combinatorial Problems
- Safe sets, network majority on weighted trees
- Analytical approach to parallel repetition
- Improved Parameterized Upper Bounds for Vertex Cover
- Independent set reconfiguration parameterized by modular-width
- Constructive-destructive heuristics for the safe set problem
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- A combinatorial branch and bound for the safe set problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Safe sets and in-dominating sets in digraphs
