Search for dissertations about: "anders dessmark"

Found 1 swedish dissertation containing the words anders dessmark.

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