ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Google’s June 2025 Core Update just finished. What’s notable is that while some say it was a big update, it didn’t feel disruptive, indicating that the changes may have been more subtle than game ...

Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm that can be used to approximately solve combinatorial optimization problems. However, a major ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

University of Virginia School of Engineering and Applied Science professor Nikolaos Sidiropoulos has introduced a breakthrough in graph mining with the development of a new computational algorithm.

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery. University of ...

Abstract: In this paper we propose a parallel algorithm to construct a one-sided monotone polygon from a Hamiltonian 2-sep chordal graph which takes O(log n) time and uses O(n) processors on a CREW ...