Search for dissertations about: "cographs"
Found 2 swedish dissertations containing the word cographs.
-
1. Graph Decomposition Using Node Labels
Abstract : .... READ MORE
-
2. New Results on Combinatorial Algorithms
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
Result pages:
1