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 2 of 2 for “"fixed-parameter algorithms"”.

  1. Topics in Graph Algorithms: Structural Results and Algorithmic Techniques, with Applications

    … has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. We mainly study some emergent techniques that help to bridge the gap between computational …

    utk-theses Repository record for Topics in Graph Algorithms: Structural Results and Algorithmic Techniques, with Applications (opens in a new tab)

  2. Generalized Set and Graph Packing Problems

    … exist applications that model a community as a fixed graph H [98, 10, 119, 2, 142, 136]. Additionally, it is not expected that an entity of the network belongs to only one community; that is, communities tend to share their members. The community discovering or community detection problem …

    waterloo Repository record for Generalized Set and Graph Packing Problems (opens in a new tab)