Speedup the optimization of maximal closure of a node-weighted directed acyclic graph

Zhi-Ming Chen (), Cheng-Hsiung Lee () and Hung-Lin Lai ()
Additional contact information
Cheng-Hsiung Lee: Chihlee University of Technology
Hung-Lin Lai: Chihlee University of Technology

OPSEARCH, 2022, vol. 59, issue 4, No 9, 1413-1437

Abstract: Abstract The maximal closure optimization problem of a node-weighted graph is a super class of the optimal monotonic Boolean function problem. It is known that the maximal closure optimization problem can be transformed to a min-s-t cut problem. This paper focuses on the complement problem of the maximal closure on a node-weighted directed acyclic graph, named optimal pruning of node-weighted directed acyclic graph (OPNWDAG). A variant of transformation is proposed and a framework of scheme is developed to speed up the solving time of the OPNWDAG. They also can be applied to solve the optimal monotonic Boolean function problem. The experiments show that the improvement is significant and the speedup of time complexity is $$O(n^{0.209} ) $$ O ( n 0.209 ) at least.

Keywords: Maximal closure; Optimal monotonic Boolean function; Pruning cost; Node-weighted directed acyclic graph; Weighted partial order set (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-022-00595-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00595-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-022-00595-z

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().