Generating Two-Terminal Directed Acyclic Graphs with a Given Complexity Index by Constraint Logic Programming.
In: Journal of Logic and Algebraic Programming, Jg. 62 (2005) ; Nr. 1, S. 1 - 39
ISSN: 0743-1066, 1567-8326
Zeitschriftenaufsatz / Fach: Wirtschaftswissenschaften
Two-terminal directed acyclic graphs (st-dags) are used to model problems in many areas and, hence, measures for their topology are needed. Complexity Index (CI) is one such measure and is defined as the minimum number of node reductions required to reduce a given st-dag into a single-arc graph, when used along with series and parallel reductions. In this research we present a constraint logic programming algorithm (implemented in ILOG's OPL––Optimization Programming Language) for the generation of st-dags with a given CI. To this end the complexity graph with a maximum matching of CI, the dominator tree, the reverse dominator tree and the st-dag are characterized by a set of constraints. Then a multi-phase algorithm is presented which searches the space described by the set of constraints. Finally, the computational performance of the algorithm is tested.
Dieser Eintrag ist freigegeben.