Image de couverture de livre

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bressan, Marco, Clemente, Stefano, Fumagalli, Giacomo
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Databases Discrete Mathematics Social and Information Networks 68W05, 68R10 H.2.8; H.2.4; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
par: Shlyk, Vasiliy S.
Publié: (2026)

Competitive Data-Structure Dynamization
par: Mathieu, Claire, et autres
Publié: (2020)

Heterogeneity in Entity Matching: A Survey and Experimental Analysis
par: Moslemi, Mohammad Hossein, et autres
Publié: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Improving Graph Embeddings in Machine Learning Using Knowledge Completion with Validation in a Case Study on COVID-19 Spread
par: Napoli, Rosario, et autres
Publié: (2025)

Unlocking Advanced Graph Machine Learning Insights through Knowledge Completion on Neo4j Graph Database
par: Napoli, Rosario, et autres
Publié: (2025)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
par: Eslami, Navid, et autres
Publié: (2024)

Amnesiac Flooding: Easy to break, hard to escape
par: Austin, Henry, et autres
Publié: (2025)

APTAS for bin packing with general cost structures
par: Jaykrishnan, G., et autres
Publié: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Topological Relational Theory: A Simplicial-Complex View of Functional Dependencies, Lossless Decomposition, and Acyclicity
par: Senturk, Bilge, et autres
Publié: (2026)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
par: Alpay, Faruk, et autres
Publié: (2026)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
par: Buchbinder, Niv, et autres
Publié: (2024)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Modeling Concurrency Control as a Learnable Function
par: Pan, Hexiang, et autres
Publié: (2025)

Modular Fault-Tolerant DBMS
par: Fot, Nikolay, et autres
Publié: (2025)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
par: Alpay, Faruk, et autres
Publié: (2026)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Hierarchical Robust PCA for Scalable Data Quality Monitoring in Multi-level Aggregation Pipelines
par: Ojha, Preetam Kumar
Publié: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
par: Mundhra, S.
Publié: (2025)

Enhancing Diversity in Multi-objective Feature Selection
par: Miyandoab, Sevil Zanjani, et autres
Publié: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)