Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Modular decomposition"”.
-
Modular decomposition of k-hypergraphs
… to all or none of the vertices inside it. The modular decomposition tree of a graph gives an O(n)-space representation of the modules in a graph. The notion of modules in graphs has been extended to hypergraphs by Bonizzoni and Della Vedova [6]. Bonizzoni and Della Vedova also provide an …
-
Modular decomposition of undirected graphs
… analysis of the relationships between vertices. Modular decomposition has been studied since 1967 [1]. Modular decomposition breaks a graph down into smaller components that, from the outside, are inseparable. In doing so, modules provide great potential to better study problems from genetics to …
-
Modular Decomposition of Combinational Switching Networks
Made available in DSpace on 2014-12-10T20:13:31Z (GMT). No. of bitstreams: 1 7212370.pdf: 2893971 bytes, checksum: 12fb0f058da4e6d9190debd33fc2d181 (MD5) Previous issue date: 1971
-
An algorithm for modular decomposition based on multiplexes
Modular decomposition is instrumental in the the design of algorithms for solving many important graph theory problems. It has been applied towards developing recognition algorithms for many important perfect graph families. It also forms the basis of a number of efficient algorithms for solving …
-
Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs
… algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It …
-
Critical Cliques and Their Application to Influence Maximization in Online Social Networks
Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph into non-overlapping modules. A module M of an undirected graph G = (V, E) is commonly defined as a set of vertices such …
-
An optimal static scheduling algorithm for hard real-time systems specified in prototyping language
… on the theories of optimal sequencing through modular decomposition, as well as enumeration techniques. An optimal algorithm will provide the analyst with a definitive method for determining whether a given design can meet its hard real-time requirements.
-
Towards Generating Software Modularizations
… (KWIC) example from Parnas' seminal paper on modular decomposition. What makes this work novel is the generation of different program modularization implementations, as well as different programming paradigms (imperative or functional). This is achieved by using a common abstract internal …
-
Graph-based divide-and-conquer techniques for binary diffing
… to as the REcover technique), and (iii) a modular decomposition of program FCGs into MD-trees, which are unique up to isomorphism for a given graph. Components resulting from these partitionings are first compared at a coarse level, followed by a finer-grained comparison of the functions …
-
Design and Modularization of a Hybrid Vehicle Control System
… This thesis seeks to apply established modular principles to a Simulink Model to increase information hiding to improve the maintainability of controls software. A Hybrid Supervisory Controller (HSC) model, developed as part of the McMaster EcoCAR Competition, is used throughout this …
-
A methodology for trustworthy file systems
… formal model and low-level code. Cogent takes a modular file system implementation as input and generates a C implementation and a formal proof that links it to its corresponding generated Cogent specification. Cogent specifications inherit the purely functional aspect of the input source code, …
-
Recoloring in Hereditary Graph Classes: Structure and Decomposition
… In Chapter 4, we develop techniques to use the modular decomposition of a graph to prove that it is recolorable. We apply these techniques to study recolorability of several subclasses of P5-free graphs. In Chapter 5, we study reconfiguration in tournaments. We define an independent set in a …
-
Improving evolvability of operating systems with AspectC
… to this domain, other complexity is caused by modularity problems. The implementation of certain key system concerns seems to defy traditional modular boundaries and impede evolution. From OS/360 to Windows NT, systems suffer from unintentional interactions between modules [Lehman and Belady …
-
Joint attention in human-robot interaction
… attention, and ensuring joint attention. This modular decomposition is supported by psychological findings and matches the developmental timeline of humans. Infants start with the skill of following a caregiver's gaze, and then they exhibit imperative and declarative pointing gestures to get a …
-
Engineering Cre Recombinase for Genome Engineering
… to zinc finger and TAL effector domains, no modular decomposition of DNA specificity exists for Cre recombinase homologs. As a result, the RT specificity of Cre has previously been modified using directed evolution, a laborious approach. To accelerate the process, I used sequence information …
-
Algorithms for the Maximum Independent Set Problem
This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden …