[PDF][PDF] New graph decompositions and combinatorial boolean matrix multiplication algorithms
We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …
It's Hard to HAC with Average Linkage!
Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and
applied method for hierarchical clustering. Recent applications to massive datasets have …
applied method for hierarchical clustering. Recent applications to massive datasets have …
Rethinking the Expressiveness of GNNs: A Computational Model Perspective
Graph Neural Networks (GNNs) are extensively employed in graph machine learning, with
considerable research focusing on their expressiveness. Current studies often assess GNN …
considerable research focusing on their expressiveness. Current studies often assess GNN …
A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
A Dumitrescu - arXiv preprint arXiv:2403.01085, 2024 - arxiv.org
We revisit the algorithmic problem of finding a triangle in a graph: We give a randomized
combinatorial algorithm for triangle detection in a given $ n $-vertex graph with $ m $ edges …
combinatorial algorithm for triangle detection in a given $ n $-vertex graph with $ m $ edges …