Linear-Delay Enumeration for Minimal Steiner Problems
Summary: Linear-delay, polynomial-space algorithm to enumerate all minimal Steiner trees in directed graphs, improving Kimelfeld & Sagiv; extends to Steiner forests, terminal and directed variants. Also: polynomial-delay, exponential-space enumeration for minimal induced Steiner subgraphs on claw-free graphs; hardness result showing enumeration of minimal group-Steiner trees is at least as hard as minimal hypergraph transversal enumeration. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,072 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS | 0.00014256848 |
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,761 | Optimal Enumeration: Efficient Top-k Tree Matching | 2015 | VLDB | 4.6543114e-05 |
| 5,697 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 5.3672389e-05 |
| 2,527 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5982912e-05 |
| 5,021 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 5.7481039e-05 |
| 3,857 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6924202e-05 |
| 5,052 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.725952e-05 |
| 11,266 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1905499e-05 |
| 11,497 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1905499e-05 |
| 7,500 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7135369e-05 |
| 9,088 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.3940132e-05 |