O(m)$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
China Mobile Jiangsu and ZTE unveil intelligent complaint analysis agent to reshape core network O&M
ZTE has joined forces with China Mobile Jiangsu under the guidance of China Mobile's Network Division to pioneer the implementation of core network complaint agent capabilities, marking a significant step forward in accelerating intelligent network operations and maintenance (O&M) transformation. Both parties innovatively introduce the multi-modal signaling model and agent technology to reconstruct the complaint handling process, implement automatic signaling analysis, and efficiently...
Efficient Parallel Algorithms for Hypergraph Matching
arXiv:2602.22976v3 Announce Type: replace Abstract: We present efficient parallel algorithms for computing maximal matchings in hypergraphs. Our algorithm finds locally maximal edges in the hypergraph and adds them in parallel to the matching. In the CRCW PRAM models our algorithms achieve $O(\log{\log{\Delta}}\log{m})$ time with $O(\kappa\log {m})$ work w.h.p. where $m$ is the number of hyperedges, and $\kappa$ is the sum and $\Delta$ is the maximum of all vertex degrees.
Listing Even Cycles Faster than the Submodular-Width Barrier
arXiv:2605.30564v1 Announce Type: new Abstract: A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all $2k$-cycles in an $m$-edge graph can be listed in $\tilde O(m^{2-1/k}+t)$ time, where $t$ is the output size. This bound underlies the {\em submodular width} of Marx (JACM 2013) and the PANDA framework of Abo Khamis, Ngo, and Suciu (PODS 2017), which extend AYZ to arbitrary conjunctive queries with degree constraints. A central open question is whether...
Efficient Mean Curvature Computation on High-Dimensional Data Manifolds
Announce Type: new Abstract: Estimating local mean curvature at each point of a high-dimensional dataset is a key ingredient of geometry-aware machine learning algorithms, such as the Mean Curvature Boundary Points (MCBP) method. The naive implementation of this computation, based on a local shape operator approximated from k-nearest neighbor patches, involves an explicit construction of a matrix $H$ whose trace form yields an $O(m^4)$ cost per point, rendering the approach intractable for...
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
arXiv:2504.18352v2 Announce Type: replace Abstract: Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with linear running time. Our result improves the previous two-and-a-half-decades-old algorithm by de Berg, Cheong, Devillers, van Kreveld, and Teillaud (1998), which ran in $O((n+m)\log(n+m))$ time, as well as...
Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
new Abstract: The subgraph isomorphism problem and its generalizations such as conjunctive queries, where some nodes are projected, are among the most fundamental problems in graph algorithms and database theory. In this paper, we study the listing and enumeration variants of these problems and present two main results. (1) We present the first algorithms for enumerating projected trees with polynomial preprocessing time ($\widetilde{O}(n^{17.42})$) and polylogarithmic delay...
Towards Long-Horizon Interpretability: Efficient and Faithful Multi-Token Attribution for Reasoning LLMs
arXiv:2602.01914v4 Announce Type: replace Abstract: Token attribution methods provide intuitive explanations for language model outputs by identifying causally important input tokens. However, as modern LLMs increasingly rely on extended reasoning chains, existing schemes face two critical challenges: (1) efficiency bottleneck, where attributing a target span of M tokens within a context of length N requires O(M*N) operations, making long-context attribution prohibitively slow; and (2)...
Removing bottlenecks in the recognition of small $(k,\ell)$-graph classes
arXiv:2510.17665v2 Announce Type: replace Abstract: A graph is a $(k,\ell)$-graph if its vertex set can be partitioned into $k$ independent sets and $\ell$ cliques. This family simultaneously generalizes split, bipartite, and co-bipartite graphs. While the recognition problem is NP-complete whenever $k\geq 3$ or $\ell\geq 3$, the remaining small cases are polynomial-time solvable.
Dynamic Breadth First Search with Predictions
arXiv:2606.01187v1 Announce Type: new Abstract: Given a graph $G(V,E)$ having $n$ vertices and $m$ edges, we maintain its Breadth-First Search (BFS) tree from source $s$ under an online sequence of edge updates in the prediction model. Our approach leverages a predicted update sequence aiding online processing.