Copertina

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Dumitrescu, Adrian
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
di: Madani, Amirali, et al.
Pubblicazione: (2025)

Finding Triangles or Independent Sets; and Other Dual Pair Approximations
di: Dumitrescu, Adrian
Pubblicazione: (2021)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
di: Abboud, Amir, et al.
Pubblicazione: (2025)

A Combinatorial Characterization of Constant Mixing Time
di: Lau, Lap Chi, et al.
Pubblicazione: (2025)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
di: Kuszmaul, William
Pubblicazione: (2025)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
di: Abboud, Amir, et al.
Pubblicazione: (2026)

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
di: Liu, Siyue, et al.
Pubblicazione: (2026)

A Note on Generic Tangle Algorithms
di: Elbracht, Christian, et al.
Pubblicazione: (2020)

A Lower Bound for the Max Entropy Algorithm for TSP
di: Jin, Billy, et al.
Pubblicazione: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
di: Kanaya, Yuga, et al.
Pubblicazione: (2023)

Combinatorial optimization of the coefficient of determination
di: Harary, Marc
Pubblicazione: (2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
di: Dhawan, Abhishek
Pubblicazione: (2024)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
di: Jones, Mark, et al.
Pubblicazione: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
di: Li, Hengzhe, et al.
Pubblicazione: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
di: Haviv, Ishay
Pubblicazione: (2022)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
di: Kano, Takumi, et al.
Pubblicazione: (2026)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
di: Mu, Ta-Yu, et al.
Pubblicazione: (2024)

Algorithmic study on liar's vertex-edge domination problem
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2023)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
di: Bai, Yuhang, et al.
Pubblicazione: (2026)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
di: Bentert, Matthias, et al.
Pubblicazione: (2026)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
di: Norose, Ryoma, et al.
Pubblicazione: (2024)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
di: Gavva, Surya Teja, et al.
Pubblicazione: (2025)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
di: Murakami, Hitoshi, et al.
Pubblicazione: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
di: Chizewer, Jeremy, et al.
Pubblicazione: (2023)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
di: Korhonen, Tuukka
Pubblicazione: (2024)

Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection
di: Dudek, Bartłomiej, et al.
Pubblicazione: (2026)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
di: Adriaens, Florian, et al.
Pubblicazione: (2026)

The Strong Birthday Problem Revisited
di: Tripathy, Chijul B.
Pubblicazione: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
di: Higl, Hendrik
Pubblicazione: (2026)

New Algorithm for Combinatorial $n$-folds and Applications
di: Jansen, Klaus, et al.
Pubblicazione: (2024)

A Uniformly Random Solution to Algorithmic Redistricting
di: Cai, Jin-Yi, et al.
Pubblicazione: (2024)

A note on Ordered Ruzsa-Szemerédi graphs
di: Pratt, Kevin
Pubblicazione: (2025)

A Maximum Linear Arrangement Problem on Directed Graphs
di: DeVos, Matt, et al.
Pubblicazione: (2018)

A Unified View of Graph Regularity via Matrix Decompositions
di: Bodwin, Greg, et al.
Pubblicazione: (2019)

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

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
di: Chalermsook, Parinya, et al.
Pubblicazione: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
di: Jenssen, Matthew, et al.
Pubblicazione: (2024)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
di: Glover, Charles N.
Pubblicazione: (2024)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
di: Xiao, Hanyin, et al.
Pubblicazione: (2025)

Fourier Analysis of Iterative Algorithms
di: Jones, Chris, et al.
Pubblicazione: (2024)