Name
Abstract | ||
|---|---|---|
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where ``proper'' means that the tree decomposition cannot be improved by removing or splitting a bag. The algorithm can incorporate any method for (ordinary, single result) triangulation or tree decomposition, and can serve as an anytime algorithm to improve such a method. We describe an extensive experimental study of an implementation on real data from different fields. Our experiments show that the algorithm improves upon central quality measures over the underlying tree decompositions, and is able to produce a large number of high-quality decompositions. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3034786.3056109 | PODS |
Keywords | Field | DocType |
Minimal triangulation, Tree decomposition, Enumeration algorithm, Minimal separators, Maximal independent sets, Maximal cliques | Discrete mathematics,Graph,Computer science,Tree decomposition,Theoretical computer science,Triangulation (social science),Anytime algorithm,Time complexity,Enumeration algorithm | Conference |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nofar Carmeli | 1 | 6 | 4.84 |
| Batya Kenig | 2 | 35 | 5.51 |
| Benny Kimelfeld | 3 | 1034 | 71.63 |