News

Tech Xplore1d
New framework reduces memory usage and boosts energy efficiency for large-scale AI graph analysis
BingoCGN, a scalable and efficient graph neural network accelerator that enables inference of real-time, large-scale graphs ...
IEEE23d
A deterministic near-linear time approximation scheme for geometric transportation - IEEE Xplore
In particular, we give the first $(1+\varepsilon)$-approximate deterministic algorithm for geometric bipartite matching and the first $(1+\varepsilon)$ approximate deterministic or randomized ...
World Scientific24d
List 2-distance coloring of planar graphs without short cycles | Discrete Mathematics, Algorithms and Applications - World Scientific Publishing Co Pte Ltd
W. Wang and K. W. Lih, Labeling planar graphs with condition on girth and distance two, SIAM J. Discrete Math. 17 (2003) 264–275. Crossref, Google Scholar; 13. G. Wegner, Graphs with given diameter ...
IEEE28d
An O (n √ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs | IEEE Conference Publication | IEEE Xplore
Let G = (V, E) be an undirected graph, where V is the vertex set and E is the edge set. A subset M of E is an induced matching of G if M is a matching of G and no two edges in M are joined by an edge.