A maximum dicut in a digraph induced by a minimal dominating set

DOI10.33048/daio.2020.27.691zbMath1493.05139OpenAlexW4256384527MaRDI QIDQ5090164

Vladimir Vladimirovich Voroshilov

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da1265

zbMATH Keywords

directed graphweighted graphmaximum dicutinclusion minimal dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• On the max min vertex cover problem
• On the computational complexity of upper fractional domination
• A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
• Max-Cut Under Graph Constraints
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A maximum dicut in a digraph induced by a minimal dominating set