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 tree decompositions, in incremental polynomial time, where proper means that the tree decomposition cannot be improved by removing or splitting a bag. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Data Structures and Algorithms | Discrete mathematics,Graph,Combinatorics,Tree decomposition,Enumeration,Time complexity,Mathematics |
DocType | Volume | Citations |
Journal | abs/1604.02833 | 1 |
PageRank | References | Authors |
0.36 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nofar Carmeli | 1 | 6 | 4.84 |
| Batya Kenig | 2 | 35 | 5.51 |
| Benny Kimelfeld | 3 | 1034 | 71.63 |