Cover Image

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bringmann, Karl, Fischer, Nick, Wang, Yanheng
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
by: Wang, Kaixin, et al.
Published: (2023)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
by: Bringmann, Karl, et al.
Published: (2024)

Listing Even Cycles Faster than the Submodular-Width Barrier
by: Nakos, Vasileios, et al.
Published: (2026)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
by: Kenig, Batya, et al.
Published: (2024)

Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Near-Optimal Directed Low-Diameter Decompositions
by: Bringmann, Karl, et al.
Published: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses
by: Fischer, Nick
Published: (2026)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

Knapsack with Small Items in Near-Quadratic Time
by: Bringmann, Karl
Published: (2023)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
by: Wang, Huayi, et al.
Published: (2026)

Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
by: Li, Xuan, et al.
Published: (2024)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
by: Ertl, Otmar
Published: (2024)

Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
by: Ertl, Otmar
Published: (2023)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026)

Distinct Shortest Walk Enumeration for RPQs
by: David, Claire, et al.
Published: (2023)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)

Approximate Butterfly Counting in Sublinear Time
by: Luo, Chi, et al.
Published: (2026)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Socio-Spatial Group Queries for Impromptu Activity Planning
by: Shen, Chih-Ya, et al.
Published: (2015)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
by: Abeywickrama, Tenindra, et al.
Published: (2026)

Approaching 100% Confidence in Stream Summary through ReliableSketch
by: Wu, Yuhan, et al.
Published: (2024)