Efficiently Enumerating Minimal Triangulations
Summary: Enumerates all minimal triangulations of a graph in incremental polynomial time, hence all proper tree decompositions (no bag removable or splittable). Framework wraps any single-result triangulation/decomposition as an anytime enumerator and yields many higher-quality decompositions in practice. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nofar Carmeli
- 2. Batya Kenig
- 3. Benny Kimelfeld
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,076 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.709895e-05 |
| 7,073 | Mining Approximate Acyclic Schemes from Relations | 2020 | SIGMOD | 4.8378353e-05 |
| 7,500 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7135369e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 610 | Design and Implementation of the LogicBlox System | 2015 | SIGMOD | 0.00019204048 |
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
| 5,050 | DunceCap: Query Plans Using Generalized Hypertree Decompositions | 2015 | SIGMOD | 5.7268774e-05 |
| 5,137 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6653126e-05 |
| 5,331 | Optimizing and Parallelizing Ranked Enumeration | 2011 | VLDB | 5.5642069e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,538 | On Asymptotic Cost of Triangle Listing in Random Graphs | 2017 | PODS | 4.4893996e-05 |
| 5,376 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5407342e-05 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.4765914e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |
| 2,219 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2653868e-05 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 7,500 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7135369e-05 |