Search for dissertations about: "graph decomposition"
Showing result 1 - 5 of 29 swedish dissertations containing the words graph decomposition.
-
1. Graph Decomposition Using Node Labels
Abstract : .... READ MORE
-
2. Advances in Functional Decomposition: Theory and Applications
Abstract : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. READ MORE
-
3. Graph dominators in logic synthesis and verification
Abstract : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. READ MORE
-
4. Dominator-based Algorithms in Logic Synthesis and Verification
Abstract : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. READ MORE
-
5. Optimal and Hereditarily Optimal Realizations of Metric Spaces
Abstract : This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an optimal realization of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NP-hard, and solutions are not necessarily unique. READ MORE