Sökning: "cographs"

Hittade 2 avhandlingar innehållade ordet cographs.

1. 1. Graph Decomposition Using Node Labels

   Författare :Öjvind Johansson; KTH; []
   Nyckelord :graph decomposition; modular decomposition; cographs; NLC-width; clique-width;

   Sammanfattning : .... LÄS MER

3. 2. New Results on Combinatorial Algorithms

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

   Sammanfattning : 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). LÄS MER