Browsing Department of Informatics by Subject "moderately exponential time"
Now showing items 1-1 of 1
-
Finding Induced Subgraphs via Minimal Triangulations
(Peer reviewed; Journal article, 2010)Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in- cluding Minimum Fill-in and Treewidth. We discover unexpected ...