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 1 of 1 for “"Rooted path graphs"”.

  1. Path and cycle hitting problems: algorithms and complexity

    … problems are known to be NP-complete on general graphs. It is considered unlikely that there exist polynomial-time algorithms for solving them. Motivated by the fact that many of these problems have real-world applications, researchers have been primarily focused on designing faster and faster …

    greece Repository record for Path and cycle hitting problems: algorithms and complexity (opens in a new tab)