Search for dissertations about: "Subgraph isomorphism"

Found 3 swedish dissertations containing the words Subgraph isomorphism.

2. 1. New Results on Combinatorial Algorithms

   Author : Anders Dessmark; Data Vetenskap; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

   Abstract : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). READ MORE

4. 2. Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning

   Author : Stephan Gocht; Parallella System; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; certifying algorithms; 0-1 linear inequalities; combinatorial algorithms; proof logging;

   Abstract : Over the last decades, dramatic improvements in combinatorialoptimisation algorithms have significantly impacted artificialintelligence, operations research, and other areas. These advances,however, are achieved through highly sophisticated algorithms that aredifficult to verify and prone to implementation errors that can causeincorrect results. READ MORE

5. 3. Automated System Level Software Testing of Networked Embedded Systems

   Author : Per Erik Strandberg; Sundmark Daniel; Wasif Afzal; Elizabeth Bjarnason; Mälardalens högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Science; datavetenskap;

   Abstract : Embedded systems are ubiquitous and play critical roles in management systems for industry and transport. Software failures in these domains may lead to loss of production or even loss of life, so the software in these systems needs to be reliable. READ MORE