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 “"Node multiway cut"”.

  1. Path and cycle hitting problems: algorithms and complexity

    … and is known in the relevant literature as the node multiway cut (NMC) problem: given a (vertex-weighted) graph and a terminal set, we search for a minimum-sized (minimum-weighted) terminal-free vertex subset of the graph which hits every vertex subset of the graph that induces a path between …

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