Image de couverture de livre

Counting Patterns in Degenerate Graphs in Constant Space

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Komarath, Balagopal, Kumar, Anant, Pareek, Akash
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Greedy BST on Permutation Initial Tree
par: Pareek, Akash
Publié: (2024)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
par: Pareek, Akash, et autres
Publié: (2025)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
par: Roy, Shubhajit, et autres
Publié: (2023)

Inapproximability of Counting Permutation Patterns
par: Opler, Michal
Publié: (2026)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
par: Kumar, Akash, et autres
Publié: (2026)

Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
par: Darmasubramanian, Kailash Gopal, et autres
Publié: (2025)

Contextual Pattern Mining and Counting
par: Li, Ling, et autres
Publié: (2025)

Cover Edge-Based Novel Triangle Counting
par: Bader, David A., et autres
Publié: (2024)

In-Place BWT and Lyndon Array Construction in Constant Space
par: Louza, Felipe A., et autres
Publié: (2025)

Counting Permutation Patterns with Multidimensional Trees
par: Beniamini, Gal, et autres
Publié: (2024)

Quantum Pattern Matching in Generalised Degenerate Strings
par: Equi, Massimo, et autres
Publié: (2026)

Enumerating m-Length Walks in Directed Graphs with Constant Delay
par: Adamson, Duncan, et autres
Publié: (2024)

New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching
par: Fischer, Nick, et autres
Publié: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
par: Hebert-Johnson, Ursula, et autres
Publié: (2023)

Near-Optimal Four-Cycle Counting in Graph Streams
par: Lüderssen, Sebastian, et autres
Publié: (2026)

Gray Codes With Constant Delay and Constant Auxiliary Space
par: Amarilli, Antoine, et autres
Publié: (2026)

Enhanced Graph Pattern Matching
par: Cotumaccio, Nicola
Publié: (2024)

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
par: Meng, Lingkai, et autres
Publié: (2024)

Elastic-Degenerate String Comparison
par: Gabory, Esteban, et autres
Publié: (2024)

Internal Pattern Matching in Small Space and Applications
par: Bathie, Gabriel, et autres
Publié: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
par: Ye, Xiaowei, et autres
Publié: (2024)

Space-Efficient Graph Kernelizations
par: Kammer, Frank, et autres
Publié: (2020)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
par: Xuan, Wei, et autres
Publié: (2025)

Constant sensitivity on the CDAWGs
par: Hamai, Rikuya, et autres
Publié: (2025)

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
par: Li, Cheng, et autres
Publié: (2025)

Constant-Stretch Rounding on the Hypersimplex
par: Anari, Nima, et autres
Publié: (2026)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
par: Assadi, Sepehr, et autres
Publié: (2025)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
par: Lee, Seoyong, et autres
Publié: (2026)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
par: Csikós, Mónika, et autres
Publié: (2023)

Maximizing the Minimum Eigenvalue in Constant Dimension
par: Brown, Adam, et autres
Publié: (2024)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
par: Kumar, Mrinal, et autres
Publié: (2024)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

Rapid Exploration of Assembly Chemical Space of Molecular Graphs
par: Seet, Ian, et autres
Publié: (2024)

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
par: Kapralov, Michael, et autres
Publié: (2022)

Multi-dimensional Approximate Counting
par: Wang, Dingyu
Publié: (2024)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
par: Hammer, Nina, et autres
Publié: (2022)