Transitive Closure Algorithm using Binary OR Operation: Primes Algorithm, GHK Algorithm
نویسندگان
چکیده
منابع مشابه
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
A Single-Pass Algorithm for Transitive Closure
One of the most attractive methods for computing the transitive closure of a binary relation is to apply depth-rst search to the corresponding directed graph, recognize the strongly connected components, and, at the same time, compute the successor lists for all nodes. Recognizing the strongly connected components is important because the straightforward successor list computation computes corr...
متن کاملA Parallel Algorithm for Transitive Closure
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of e...
متن کاملOptimization of Dez dam reservoir operation using genetic algorithm
Water reservoir programming studies aim to determine the final cultivated land area based on predefined agricultural models and water requirements. Dam utilization rule curve is also provided in such studies. The system of Dez dam water resources was simulated applying the basic information in order to determine the capability of its reservoir to provide the objectives of the performed plan. As...
متن کاملA Fault-Independent Transitive Closure Algorithm for Redundancy Identification
We present a fault-independent redundancy identification algorithm. The controllabilities and observabilities are defined as Boolean variables and represented on an implication graph. A major enhancement over previously published results is that we include all direct and partial implications, as well as node fixation. The transitive closure, whose computation now requires a new algorithm, provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The SIJ Transactions on Computer Science Engineering & its Applications (CSEA)
سال: 2015
ISSN: 2321-2373,2321-2381
DOI: 10.9756/sijcsea/v3i2/03030100101