Comparison of heuristics for a problem of maximization of dicut, generated by minimal dominating set in a non-directededge-weighted graph

A. A. Totskij, Ruslan Y. Simanchev, Inna V. Urazova

Source record

Source: Crossref

Published: Aug 31, 2026

DOI: 10.24147/2222-8772.2026.2.54-62

Open original source ↗

Source abstract

The article describes some heuristic algorithms and a integer linear programming model for a problem of maximization of dicut, generated by minimal dominating set in a non-directed edge-weighted graph. Results of a numerical experiment are presented.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.