Cover Image

Simple and efficient four-cycle counting on sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Burkhardt, Paul, Harris, David G.
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
by: Kowalik, Lukasz
Published: (2024)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
by: Bodlaender, Hans L., et al.
Published: (2025)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
by: Harris, David G.
Published: (2023)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
by: Harris, David G.
Published: (2021)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
by: Bonnet, Édouard, et al.
Published: (2026)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
by: Lokshtanov, Daniel, et al.
Published: (2026)

Testing H-freeness on sparse graphs, the case of bounded expansion
by: Humeau, Samuel, et al.
Published: (2025)

Quantum property testing in sparse directed graphs
by: Apers, Simon, et al.
Published: (2024)

Improved parallel derandomization via finite automata with applications
by: Giliberti, Jeff, et al.
Published: (2024)

Reconstruction of geometric random graphs with the Simple algorithm
by: Stegehuis, Clara, et al.
Published: (2024)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
by: Becchetti, Luca, et al.
Published: (2025)

Data reduction for directed feedback vertex set on graphs without long induced cycles
by: Dirks, Jona, et al.
Published: (2023)

Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Zip-Tries: Simple Dynamic Data Structures for Strings
by: Eppstein, David, et al.
Published: (2025)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)

Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

Finding longer cycles via shortest colourful cycle
by: Björklund, Andreas, et al.
Published: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
by: Deák, Bence, et al.
Published: (2026)

Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)

Partition-based Simple Heaps
by: Brodal, Gerth Stølting, et al.
Published: (2026)

Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)

A new notion of commutativity for the algorithmic Lovász Local Lemma
by: Harris, David G., et al.
Published: (2020)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
by: Song, Shihong, et al.
Published: (2024)

Simple Linear-Size Additive Emulators
by: Hoppenworth, Gary
Published: (2023)

Maximal Palindromes in MPC: Simple and Optimal
by: Pissis, Solon P.
Published: (2025)

Simple Linear-time Repetition Factorization
by: Yonemoto, Yuki, et al.
Published: (2024)

Simple Realizability of Abstract Topological Graphs
by: Da Lozzo, Giordano, et al.
Published: (2024)

Simple Length-Constrained Expander Decompositions
by: Bodwin, Greg, et al.
Published: (2025)

Approximate counting of permutation patterns
by: Ben-Eliezer, Omri, et al.
Published: (2024)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
by: Brubach, Brian, et al.
Published: (2020)

Simple Algorithms for Fully Dynamic Edge Connectivity
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

A Simple Algorithm for Clustering Discrete Distributions
by: Mitra, Pradipta
Published: (2026)

A Simple Algorithm for Dynamic Carpooling with Recourse
by: Efron, Yuval, et al.
Published: (2024)